A construction of distance cospectral graphs
From MaRDI portal
Publication:2408950
Abstract: The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edge counts yet are cospectral with respect to the distance matrix. Further, we identify a subgraph switching behavior which constructs additional distance cospectral graphs. The proofs for both constructions rely on a perturbation of (most of) the distance eigenvectors of one graph to yield the distance eigenvectors of the other.
Recommendations
Cites work
Cited in
(8)- Cospectral constructions for several graph matrices using cousin vertices
- Spectral properties of the exponential distance matrix
- The normalized distance Laplacian
- Spectra of variants of distance matrices of graphs and digraphs: a survey
- Some graphs determined by their distance spectrum
- On the Wiener index, distance cospectrality and transmission-regular graphs
- Graphs that are cospectral for the distance Laplacian
- Construction of cospectral graphs
This page was built for publication: A construction of distance cospectral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408950)