Smallest Vertex-Transitive Graphs of Given Degree and Diameter

DOI10.1002/jgt.21727zbMath1280.05066OpenAlexW1910898587MaRDI QIDQ2874095

Jozef Širáň, Martin Knor

Publication date: 28 January 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21727

zbMATH Keywords

Cayley graphvertex-transitive graphextremal problemdegree/diameter problemsmallest graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items

On the defect of vertex-transitive graphs of given degree and diameter ⋮ Smallest regular graphs of given degree and diameter

Uses Software

• Magma

Cites Work

• Regular graphs with excess one
• The Magma algebra system. I: The user language
• Cubic vertex-transitive graphs on up to 1280 vertices
• Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
• On graphs of defect at most 2
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• Connectivity of transitive graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smallest Vertex-Transitive Graphs of Given Degree and Diameter