Largest Graphs of Diameter 2 and Maximum Degree 6

DOI10.1007/11889342_54zbMATH Open1158.68433OpenAlexW2173273535MaRDI QIDQ5504231FDOQ5504231

Authors: Sergey Molodtsov 

Publication date: 22 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889342_54

Recommendations

• Largest Graphs of Diameter 2 and Maximum Degree 6
• Largest planar graphs of diameter two and fixed maximum degree
• A note on large graphs of diameter two and given maximum degree
• New Largest Graphs of Diameter 6
• Large Graphs with Given Degree and Diameter—Part I

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (6)

• On graphs of defect at most 2
• Tight bounds for the \(N_2\)-chromatic number of graphs
• Largest Graphs of Diameter 2 and Maximum Degree 6
• A note on Reed's conjecture for triangle-free graphs
• Largest 6-regular toroidal graphs for a given diameter
• Largest planar graphs and largest maximal planar graphs of diameter two

This page was built for publication: Largest Graphs of Diameter 2 and Maximum Degree 6

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