Large Graphs with Given Degree and Diameter III

DOI10.1016/S0304-0208(08)73544-8MaRDI QIDQ3958494zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, C. Delorme, Guy Farhi

Publication date 1982

Published in Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73544-8

zbMATH Keywords

given degree and diametermaximum number of vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(7)

• Tables of large graphs with given degree and diameter
• Examples of products giving large graphs with given degree and diameter
• Matchings and covers in hypergraphs
• Maximal cubic graphs with diameter 4
• On new record graphs close to bipartite Moore graphs
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• Large graphs with given degree and diameter. II

This page was built for publication: Large Graphs with Given Degree and Diameter III

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958494)