On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4

DOI10.1142/S1005386723000482MaRDI QIDQ6072084zbMATH OpenOpenAlexFDO

Authors

Publication date 29 November 2023

Published in Algebra Colloquium (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1005386723000482

zbMATH Keywords

canonical graphdistance hereditary graphdistance spectrumprimitive graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• On graphs with at least three distance eigenvalues less than \(-1\)
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• The multiplicity of \(-2\) as an eigenvalue of the distance matrix of graphs

Cited in

(2)

• On graphs with at least three distance eigenvalues less than \(-1\)
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

This page was built for publication: On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072084)