Bounding the diameter of a distance-transitive graph

DOI10.1016/0095-8956(74)90056-2zbMath0269.05107OpenAlexW2068772365MaRDI QIDQ2563167

Yanyan Li

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90056-2

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

The diameter of bipartite distance-regular graphs

Cites Work

• Unnamed Item
• Primitive permutation groups with small orbitals
• Graphs and finite permutation groups
• Graphs and finite permutation groups. II
• Distance-Transitive Graphs of Valency Four
• On Trivalent Graphs
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• On Tetravalent Graphs
• ARC TRANSITIVITY IN GRAPHS