Graphs that are cospectral for the distance Laplacian
From MaRDI portal
Publication:3299343
zbMath1444.05087arXiv1812.05734MaRDI QIDQ3299343
Carolyn Reinhart, Mark Yarrow, Boris Brimkov, Kate J. Lorenzen, Ken Duna, Sung-Yell Song, Leslie Hogben
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1812.05734
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Distance in graphs (05C12)
Related Items
On the smallest eigenvalue of Dα-matrix of connected graphs, Codeterminantal graphs, The normalized distance Laplacian, On the status sequences of trees, Cospectral constructions for several graph matrices using cousin vertices, Constructions of cospectral graphs with different zero forcing numbers, Enumeration of cospectral and coinvariant graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the distance spectra of graphs
- Two Laplacians for the distance matrix of a graph
- On the distance Laplacian spectra of graphs
- Constructing cospectral graphs
- Partial difference sets
- Perfect state transfer in integral circulant graphs
- Distance spectra and distance energy of integral circulant graphs
- Distance matrix polynomials of trees
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Distance spectra of graphs: a survey
- On a conjecture of Graham and Lovász about distance matrices
- On the distance spectrum of distance regular graphs
- A construction of distance cospectral graphs
- Unimodality, log-concavity, real-rootedness and beyond
- Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree
- On the Addressing Problem for Loop Switching
