Edge-distance-regular graphs are distance-regular

DOI10.1016/j.jcta.2013.02.006zbMath1277.05050arXiv1210.5649OpenAlexW2051258513MaRDI QIDQ385034

Mohammad Hasan, H. S. Yoon

Publication date: 29 November 2013

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

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

zbMATH Keywords

orthogonal polynomialshomogeneous graphbipartite distance-regular graphedge-distance-regular graphgeneralized odd graph

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Distance in graphs (05C12)

Related Items (4)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ A survey on the missing Moore graph ⋮ Completely regular clique graphs ⋮ Completely regular clique graphs. II

Cites Work

• Unnamed Item
• A spectral excess theorem for nonregular graphs
• A short proof of the odd-girth theorem
• Edge-distance-regular graphs
• An odd characterization of the generalized odd graphs
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• Feasibility conditions for the existence of walk-regular graphs
• Homogeneous graphs and regular near polygons
• Problems in algebraic combinatorics
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
• On almost distance-regular graphs
• An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
• On the Polynomial of a Graph

This page was built for publication: Edge-distance-regular graphs are distance-regular