On almost distance-regular graphs

DOI10.1016/j.jcta.2010.10.005zbMath1225.05249arXiv1202.3265MaRDI QIDQ2431269

van Dam, Edwin R., E. Garriga, C. Dalfó, Miquel Àngel Fiol, Bram L. Gorissen

Publication date: 11 April 2011

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

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

zbMATH Keywords

distance-regular graph; eigenvalues; predistance polynomial; walk-regular graph; local multiplicities

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05C12: Distance in graphs

Related Items

The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues, Spectrally extremal vertices, strong cospectrality, and state transfer, Edge-distance-regular graphs are distance-regular, On some approaches to the spectral excess theorem for nonregular graphs, The spectral excess theorem for distance-biregular graphs., A spectral equivalent condition of the \(P\)-polynomial property for association schemes, A spectral excess theorem for nonregular graphs, Dual concepts of almost distance-regularity and the spectral excess theorem, A spectral excess theorem for normal digraphs, 2-walk-regular graphs with a small number of vertices compared to the valency, On bipartite cages of excess 4, Some spectral and quasi-spectral characterizations of distance-regular graphs, Edge-distance-regular graphs, On perturbations of almost distance-regular graphs, The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\), Quotient-polynomial graphs, Some results on the eigenvalues of distance-regular graphs, Resistance characterizations of equiarboreal graphs, Geometric aspects of 2-walk-regular graphs, A characterization of bipartite distance-regular graphs, Algebraic characterizations of regularity properties in bipartite graphs, 2-walk-regular dihedrants from group-divisible designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing \((\ell ,m)\)-walk-regular graphs
• Characterizing distance-regularity of graphs by the spectrum
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Higmanian rank-5 association schemes on 40 points
• On \(k\)-walk-regular graphs
• Commutative association schemes
• Distance degree regular graphs
• Locally pseudo-distance-regular graphs
• Feasibility conditions for the existence of walk-regular graphs
• On distance-regularity in graphs
• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Problems in algebraic combinatorics
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Vertex-symmetric generalized Moore graphs.
• Boundary graphs: The limit case of a spectral property
• On the Polynomial of a Graph
• Algebraic Graph Theory
• On the algebraic theory of pseudo-distance-regularity around a set