Cospectral constructions for several graph matrices using cousin vertices
From MaRDI portal
Publication:2236386
DOI10.1515/spma-2020-0143zbMath1473.05178arXiv2002.08248OpenAlexW3174411254MaRDI QIDQ2236386
Publication date: 22 October 2021
Published in: Special Matrices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.08248
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Two Laplacians for the distance matrix of a graph
- Cospectral graphs and regular orthogonal matrices of level 2
- Constructing cospectral graphs
- A construction of cospectral graphs for the normalized Laplacian
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- The Laplacian spectrum of a graph
- A construction of distance cospectral graphs
- Graphs that are cospectral for the distance Laplacian
This page was built for publication: Cospectral constructions for several graph matrices using cousin vertices