Isospectral graphs via spectral bracketing
From MaRDI portal
Publication:6404411
arXiv2207.03924MaRDI QIDQ6404411FDOQ6404411
Authors: Fernando Lledó, John Stewart Fabila-Carrasco, Olaf Post 
Publication date: 8 July 2022
Abstract: In this article, we develop a perturbative technique to construct families of non-isomorphic discrete graphs which are isospectral for the standard (also called normalised) Laplacian and its signless version. We use vertex contractions as a graph perturbation and spectral bracketing with auxiliary graphs which have certain eigenvalues with high multiplicity. There is no need to know explicitly the eigenvalues or eigenfunctions of the corresponding graphs. We illustrate the method by presenting several families of examples of isospectral graphs including fuzzy complete bipartite graphs and subdivision graphs obtained from the previous examples. All the examples constructed turn out to be also isospectral for the standard (Kirchhoff) Laplacian on the associated equilateral metric graph.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Spectrum, resolvent (47A10) Linear difference operators (47B39)
This page was built for publication: Isospectral graphs via spectral bracketing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404411)
