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

DOI10.13001/1081-3810.2989MaRDI QIDQ5502155zbMATH OpenOpenAlexFDO

Authors Steve Butler

Publication date 17 August 2015

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

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

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

zbMATH Keywords

twinscospectral graphsscalingnormalized Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Recommendations

• A construction of cospectral graphs for the normalized Laplacian
• A cospectral family of graphs for the normalized Laplacian found by toggling
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
• Cospectral constructions for several graph matrices using cousin vertices

Cited in

(9)

• Constructing cospectral graphs via a new form of graph product
• A construction of cospectral graphs for the normalized Laplacian
• A cospectral family of graphs for the normalized Laplacian found by toggling
• A geometric construction of isospectral magnetic graphs
• Normalized Laplacian spectrum of complete multipartite graphs
• Computing Kemeny's constant for a barbell graph
• The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
• The normalized distance Laplacian
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices

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)