Using twins and scaling to construct cospectral graphs for the normalized Laplacian

From MaRDI portal
Publication:5502155

DOI10.13001/1081-3810.2989zbMATH Open1327.05201arXiv1409.8329OpenAlexW1521649988MaRDI QIDQ5502155FDOQ5502155

Steve Butler

Publication date: 17 August 2015

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Abstract: The spectrum of the normalized Laplacian matrix cannot determine the number of edges in a graph, however finding constructions of cospectral graphs with differing number of edges has been elusive. In this paper we use basic properties of twins and scaling to show how to construct such graphs. We also give examples of families of graphs which are cospectral with a subgraph for the normalized Laplacian matrix.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (7)





This page was built for publication: Using twins and scaling to construct cospectral graphs for the normalized Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502155)