Edge-distance-regular graphs

DOI10.1016/j.jcta.2011.04.011zbMath1231.05083OpenAlexW2168163195MaRDI QIDQ549255

J. Fàbrega, C. Dalfó, M. Cámara, E. Garriga, Miquel Àngel Fiol

Publication date: 7 July 2011

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

Full work available at URL: http://hdl.handle.net/2117/14502

zbMATH Keywords

orthogonal polynomialscompletely regular codeedge-distance-regular graphgeneralized odd graphspectral excess theorem

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (3)

Edge-distance-regular graphs are distance-regular ⋮ Completely regular clique graphs ⋮ A spectral excess theorem for normal digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Developments on spectral characterizations of graphs
• On \(k\)-walk-regular graphs
• Feasibility conditions for the existence of walk-regular graphs
• Problems in algebraic combinatorics
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• Boundary graphs: The limit case of a spectral property
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• On almost distance-regular graphs
• An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
• On the algebraic theory of pseudo-distance-regularity around a set

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