Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra

DOI10.1016/j.laa.2021.06.017zbMath1485.05107OpenAlexW3182799943MaRDI QIDQ1979380

Xiao-Ling Zhang

Publication date: 2 September 2021

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

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

zbMATH Keywords

mixed extension\(D\)-cospectral graph\(D\)-spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (3)

Correlation matrices of Gaussian Markov random fields over cycle graphs ⋮ Distance-regular graphs with a few \(q\)-distance eigenvalues ⋮ Graphs with three distinct distance eigenvalues

Cites Work

• Unnamed Item
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• Which graphs are determined by their spectrum?
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• Graphs with small diameter determined by their $D$-spectra

This page was built for publication: Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra