The multiplicity of -2 as an eigenvalue of the distance matrix of graphs

DOI10.2298/FIL1810681LzbMath1499.05373WikidataQ128009250 ScholiaQ128009250MaRDI QIDQ5030000

Dan Li, Ji Xiang Meng

Publication date: 15 February 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

multiplicitycospectraldistance matrix

Mathematics Subject Classification ID

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

Related Items (1)

Graphs with three distinct distance eigenvalues

Cites Work

• Spectral characterizations of almost complete graphs
• The inertia and energy of the distance matrix of a connected graph
• Which graphs are determined by their spectrum?
• On graphs with at least three distance eigenvalues less than \(-1\)
• On the least distance eigenvalue and its applications on the distance spread
• Complete multipartite graphs are determined by their distance spectra
• Determination of the inertia of a partitioned Hermitian matrix
• On the distance spectrum of graphs
• On the distance spectrum of trees

This page was built for publication: The multiplicity of -2 as an eigenvalue of the distance matrix of graphs