The diameter of bipartite distance-regular graphs

DOI10.1016/0095-8956(82)90034-XzbMath0487.05038MaRDI QIDQ1165256

Paul M. Terwilliger

Publication date: 1982

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

zbMATH Keywords

diameterdegreegirthdistance-regularintersection arrays

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (9)

A remark on bipartite distance-regular graphs of even valency ⋮ Intersection numbers of bipartite distance-regular graphs ⋮ On bounding the diameter of a distance-regular graph ⋮ A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ On distance-regular graphs with fixed valency. III ⋮ A unified view of inequalities for distance-regular graphs. I ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Root systems and the Johnson and Hamming graphs ⋮ Distance-regular graphs and (s,c,a,k)-graphs

Cites Work

• Unnamed Item
• The nonexistence of 8-transitive graphs
• On bipartite tetra0alent graphs
• Bounding the diameter of a distance-transitive graph
• Finite Permutation Groups and Finite Simple Groups
• Distance-Transitive Graphs of Valency Four
• On Trivalent Graphs
• On Tetravalent Graphs

This page was built for publication: The diameter of bipartite distance-regular graphs