Distance-regular graphs with small number of distinct distance eigenvalues

DOI10.1016/j.laa.2017.05.033zbMath1370.05129OpenAlexW2627889165MaRDI QIDQ2402442

Zoran Stanić, Milica Anđelić, Tamara Koledin, Abdullah Al-Azemi

Publication date: 7 September 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.033

zbMATH Keywords

bipartite graphdistance-regular graphblock designdistance matrixintersection array

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ Unnamed Item ⋮ On the distance spectra ofm-generationn-prism graph ⋮ Distance-regular graphs with a few \(q\)-distance eigenvalues ⋮ On main eigenvalues of chain graphs ⋮ On the distance spectrum of minimal cages and associated distance biregular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distance spectra of graphs
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• Coverings of complete bipartite graphs and associated structures
• Spectral characterizations of some distance-regular graphs
• On the distance spectrum of distance regular graphs
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• THE SECOND LARGEST ELGENVALUES OF REGULAR BIPARTITE GRAPHS
• Combinatorial Designs
• Distance-Regular Graphs with Diameter Three
• Some spectral inequalities for triangle-free regular graphs

This page was built for publication: Distance-regular graphs with small number of distinct distance eigenvalues