Complete multipartite graphs are determined by their distance spectra
From MaRDI portal
Publication:2442444
DOI10.1016/j.laa.2014.01.029zbMath1285.05114arXiv1307.5931OpenAlexW2143516466WikidataQ112882243 ScholiaQ112882243MaRDI QIDQ2442444
Publication date: 3 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5931
Symmetric functions and generalizations (05E05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (31)
Hypercubes are determined by their distance spectra ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On (distance) signless Laplacian spectra of graphs ⋮ On the distance spectra of threshold graphs ⋮ Remoteness and distance eigenvalues of a graph ⋮ Unnamed Item ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ Spectral properties of the eccentricity matrix of graphs ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Complete multipartite graphs of non-QE class ⋮ The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\) ⋮ Distance between distance spectra of graphs ⋮ On the second largest distance eigenvalue of a graph ⋮ Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum ⋮ Unnamed Item ⋮ Kite graphs determined by their spectra ⋮ Energy and inertia of the eccentricity matrix of coalescence of graphs ⋮ Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra ⋮ The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) ⋮ On graphs with at least three distance eigenvalues less than \(-1\) ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra ⋮ Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles ⋮ The distance spectrum of complements of trees ⋮ Cospectrality of graphs with respect to distance matrices ⋮ On the distance and distance Laplacian eigenvalues of graphs ⋮ Unnamed Item ⋮ On distance Laplacian and distance signless Laplacian eigenvalues of graphs ⋮ Normalized Laplacian spectrum of complete multipartite graphs ⋮ Distance spectral radius of complete multipartite graphs and majorization ⋮ On the distance spectrum of distance regular graphs ⋮ The multiplicity of -2 as an eigenvalue of the distance matrix of graphs
Cites Work
- Unnamed Item
- On the distance spectral radius of some graphs
- Distance spectral radius of graphs with \(r\) pendent vertices
- Cospectral graphs and the generalized adjacency matrix
- Developments on spectral characterizations of graphs
- On the distance matrix of a tree
- Which graphs are determined by their spectrum?
- On the distance spectrum of graphs
- On spectral radius of the distance matrix
- On the Addressing Problem for Loop Switching
This page was built for publication: Complete multipartite graphs are determined by their distance spectra
