A geometric construction of large vertex transitive graphs of diameter two

MaRDI QIDQ3423973zbMATH OpenFDO

Authors

Publication date 15 February 2007

zbMATH Keywords

Cayley graphboundcovering graph technique

Mathematics Subject Classification ID

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

Recommendations

• A note on large graphs of diameter two and given maximum degree
• Approaching the Moore bound for diameter two by Cayley graphs
• On the defect of vertex-transitive graphs of given degree and diameter
• Large vertex-transitive and Cayley graphs with given degree and diameter
• Cayley graphs of diameter two and any degree with order half of the Moore bound

Cited in

(10)

• On upper bounds and connectivity of cages
• Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
• On the defect of vertex-transitive graphs of given degree and diameter
• Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
• Unitary graphs
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
• On upper bounds of odd girth cages
• Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes
• A family of mixed graphs with large order and diameter 2
• Polarity graphs revisited

This page was built for publication: A geometric construction of large vertex transitive graphs of diameter two

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