A construction of distance cospectral graphs

DOI10.1016/J.LAA.2017.09.005MaRDI QIDQ2408950zbMATH OpenOpenAlexFDO

Authors Kristin Heysse

Publication date 10 October 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.06782

zbMATH Keywords

cospectral graphsdistance matrix

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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

• Distance between distance spectra of graphs
• Cospectrality of graphs with respect to distance matrices
• Cospectral constructions for several graph matrices using cousin vertices
• Graphs that are cospectral for the distance Laplacian
• Some results on spectral distances of graphs

Cites work

• Constructing cospectral graphs
• Distance spectra of graphs: a survey
• scientific article; zbMATH DE number 3627232 (Why is no real title available?)
• On the Wiener index, distance cospectrality and transmission-regular graphs
• The Gewirtz graph: An exercise in the theory of graph spectra

Cited in

(12)

• Construction of cospectral graphs
• Cospectral constructions for several graph matrices using cousin vertices
• On the Wiener index, distance cospectrality and transmission-regular graphs
• The normalized distance Laplacian
• Spectral properties of the exponential distance matrix
• Graphs that are cospectral for the distance Laplacian
• Some graphs determined by their distance spectrum
• Spectra of variants of distance matrices of graphs and digraphs: a survey
• Counting cospectral graphs obtained via switching
• Coalescing sets preserving cospectrality of graphs arising from block similarity matrices
• A cospectral construction for the generalized distance matrix
• Constructing adjacency and distance cospectral graphs via regular rational orthogonal matrix

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)