A note on the degree-diameter problem for arc-transitive graphs

MaRDI QIDQ5401128zbMATH OpenFDO

Authors Sanming Zhou

Publication date 12 March 2014

Full work available at URL https://arxiv.org/abs/1312.6337

zbMATH Keywords

arc-transitive graphdegree-diameter problem

Mathematics Subject Classification ID

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

Abstract: We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.

Recommendations

• A note on large graphs of diameter two and given maximum degree
• Large Graphs with Given Degree and Diameter—Part I
• Large graphs with given degree and diameter. II
• Some large graphs with given degree and diameter
• Moore graphs and beyond: a survey of the degree/diameter problem

Cited in

(2)

• \(\text{TT}_n\)-maximal digraphs of the minimum size
• Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes

This page was built for publication: A note on the degree-diameter problem for arc-transitive graphs

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