scientific article; zbMATH DE number 3902695
From MaRDI portal
Publication:3680865
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)\).
Recommendations
- Further results on degree sets for graphs
- Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. II
- On the order of a graph with a given degree set
- The degree sets of connected infinite graphs
- Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III.
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680865)