No label defined (Q3680865)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3902695 |
Statements
1984
0 references
maximal edge connectivity
0 references
maximal vertex connectivity
0 references
prescribed degree set
0 references
(D,m)-cage
0 references
0.8133222460746765
0 references
0.7755293250083923
0 references
0.7723021507263184
0 references
0.7635383605957031
0 references
The problem of the existence of graphs with maximal vertex (edge) connectivity which have a prescribed degree set and order is completely solved. The graphs which are uniquely defined by their degree set and order are characterized. The results of \textit{G. Chartrand}, \textit{P. Gould} and \textit{S. Kapoor} [Period. Math. Hung. 12, 261--266 (1981; Zbl 0449.05038)] on calculating \(f(D,m)\) are extended \((f(D,m)\) is the least order of the graph called \((D,m)\)-cage, with degree set \(D\) and girth \(m)\).
0 references