A construction of distance cospectral graphs

From MaRDI portal
Publication:2408950

DOI10.1016/J.LAA.2017.09.005zbMATH Open1371.05163arXiv1606.06782OpenAlexW2963330245MaRDI QIDQ2408950FDOQ2408950


Authors: Kristin Heysse Edit this on Wikidata


Publication date: 10 October 2017

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

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.


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




Recommendations




Cites Work


Cited In (8)





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)