Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity

zbMath1448.05127arXiv1608.00091MaRDI QIDQ5124690

Víctor Diego, J. Fàbrega, Miquel Àngel Fiol

Publication date: 30 September 2020

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

zbMATH Keywords

distance-regular graphgraph spectrumpredistance polynomialsspectral excess theorempreintersection numbers

Mathematics Subject Classification ID

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

Related Items

The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• A spectral equivalent condition of the \(P\)-polynomial property for association schemes
• A spectral excess theorem for nonregular graphs
• A short proof of the odd-girth theorem
• Some spectral and quasi-spectral characterizations of distance-regular graphs
• Characterizing \((\ell ,m)\)-walk-regular graphs
• Spectra of 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
• The Gewirtz graph: An exercise in the theory of graph spectra
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• An eigenvalue characterization of antipodal distance-regular graphs
• Spectral characterizations of some distance-regular graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• On almost distance-regular graphs
• A new family of distance-regular graphs with unbounded diameter
• On the Polynomial of a Graph