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.
Publisher
University of Wyoming Libraries
Subject
Algebra and Number Theory
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Isospectral graphs via spectral bracketing;Linear Algebra and its Applications;2024-05
2. Discrete Graphs;Operator Theory: Advances and Applications;2023-11-08
3. A geometric construction of isospectral magnetic graphs;Analysis and Mathematical Physics;2023-07-05
4. Cospectral graphs for the normalized Laplacian;AIMS Mathematics;2022
5. The normalized distance Laplacian;Special Matrices;2021-01-01