A cospectral family of graphs for the normalized Laplacian found by toggling

DOI10.1016/J.LAA.2016.06.033MaRDI QIDQ306482zbMATH OpenOpenAlexFDO

Authors Steve Butler, Kristin Heysse

Publication date 31 August 2016

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

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

zbMATH Keywords

cospectral graphscharacteristic polynomialnormalized Laplaciantoggling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Abstract: We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral graphs with differing number of edges, including situations where one graph is a subgraph of the other. The method used to demonstrate cospectrality is by showing the characteristic polynomials are equal.

Recommendations

• A construction of cospectral graphs for the normalized Laplacian
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
• Graphs that are cospectral for the distance Laplacian
• A family of graphs that are determined by their normalized Laplacian spectra
• On the spectrum of the normalized graph Laplacian
• On the Normalized Laplacian Spectrum of Some Graphs
• Normalized Laplacian spectrum of a graph and majorization
• A note on the normalized Laplacian spectra

Cites work

• scientific article; zbMATH DE number 863490 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A construction of cospectral graphs for the normalized Laplacian
• Combinatorial matrix theory
• Constructing cospectral graphs
• Handbook of linear algebra
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian

Cited in

(10)

• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• A family of graphs that are determined by their normalized Laplacian spectra
• Normalized Laplacian spectrum of complete multipartite graphs
• Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
• The normalized distance Laplacian
• On the normalized Laplacians with some classical parameters involving graph transformations
• A construction of cospectral graphs for the normalized Laplacian
• Spectral faux trees
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• A geometric construction of isospectral magnetic graphs

This page was built for publication: A cospectral family of graphs for the normalized Laplacian found by toggling

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