The diameter of bipartite distance-regular graphs

DOI10.1016/0095-8956(82)90034-XMaRDI QIDQ1165256zbMATH OpenFDO

Authors Paul Terwilliger

Publication date 1982

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(82)90034-X

zbMATH Keywords

degreediameterdistance-regulargirthintersection arrays

Mathematics Subject Classification ID

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

Cites work

• Bounding the diameter of a distance-transitive graph
• Distance-Transitive Graphs of Valency Four
• Finite Permutation Groups and Finite Simple Groups
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On bipartite tetra0alent graphs
• On Tetravalent Graphs
• On Trivalent Graphs
• The nonexistence of 8-transitive graphs

Cited in

(11)

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

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

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