Results 251 to 260 of about 14,411,939 (297)
Some of the next articles are maybe not open access.
Observability of complete multipartite graphs with equipotent parts
Ars Comb., 1995By the observability of a graph is meant the least \(k\) admitting a proper colouring of its edges by \(k\) colours in such a way that each vertex is identifiable by the set of colours of its incident edges. This paper shows that for \(p\) not less than 3 and \(q\) not less than 2 the complete \(p\)-partite graph with all parts of cardinality \(q\) has
Mirko Hornák, Roman Soták
openaire +2 more sources
New fundamental relation and complete part of fuzzy hypermodules
Journal of Discrete Mathematical Sciences and Cryptography, 2022Bijan Davvaz, Narjes Firouzkouhi
exaly
SPOCK: A feasibility study on the completeness of parts lists
1997Parts lists in motor-industries are very complex and as well very dynamic entities. They are changed up to 600 times a year. New parts are constructed in the context of an already existing parts list. Verifying and certifying the completeness of such lists is an expensive and time-intensive job which requires several experts' work.
openaire +2 more sources
Part A, Introduction, Complete Volume
Treatise on Invertebrate Paleontology, 1979W. A. Berggren +14 more
openaire +1 more source
Complete Unaccompanied Madrigals, Part 1
2003This edition presents, in four volumes, the complete unaccompanied madrigals of Luzzasco Luzzaschi, director of music at the Ferrarese court at the end of the sixteenth century. Luzzaschi was among the most important and most admired musicians of the period, the teacher of Girolamo Frescobaldi, the mentor of Carlo Gesualdo, and the object of explicit ...
openaire +1 more source
Part II: 6 The completeness of the presentation
20036.1 The Koszul complex 6.2 Carlson’s completeness criterion 6.3 Duflot regular sequences 6.4 Groups of small rank: Koszul complex and Poincare series 6.5 Identifying ...
openaire +1 more source
On a Conjecture of Hanna Connecting Distinct Part and Complete Partitions
Annals of Combinatorics, 2020George Andrews, Brian Hopkins
exaly

