The distance spectrum of complements of trees
From MaRDI portal
Publication:2013185
DOI10.1016/j.laa.2017.05.016zbMath1367.05133OpenAlexW2613198330MaRDI QIDQ2013185
Publication date: 3 August 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.016
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)
Related Items (9)
The distance Laplacian spectral radius of clique trees ⋮ The distance eigenvalues of the complements of unicyclic graphs ⋮ The distance spectrum of the complements of graphs of diameter greater than three ⋮ The distance spectrum of the complements of graphs with two pendent vertices ⋮ Extremal problems for the eccentricity matrices of complements of trees ⋮ Distance Laplacian spectral radius of the complements of trees and unicyclic graphs ⋮ A note on the distance and distance signless Laplacian spectral radius of complements of trees ⋮ Distance spectral radius of the complements of trees with fixed parameters ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra
Cites Work
- Unnamed Item
- On the distance spectral radius of some graphs
- The least eigenvalue of the complements of trees
- Eigenvalue interlacing for certain classes of matrices with real principal minors
- On the distance matrix of a tree
- Commutativity and spectra of Hermitian matrices
- The complement of the path is determined by its spectrum
- Distance spectra of graphs: a survey
- On the least distance eigenvalue and its applications on the distance spread
- On the least distance eigenvalue of a graph
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: The distance spectrum of complements of trees
