A note about cospectral graphs for the adjacency and normalized Laplacian matrices

DOI10.1080/03081080902722741zbMATH Open1187.05046OpenAlexW2009878382MaRDI QIDQ3564201FDOQ3564201

Authors: Steve Butler 

Publication date: 2 June 2010

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080902722741

Recommendations

• On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
• A construction of cospectral graphs for the normalized Laplacian
• On the construction of cospectral nonisomorphic bipartite graphs
• Constructing cospectral bipartite graphs
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian

zbMATH Keywords

bipartiteadjacency matrixcospectralnormalized Laplacian

Mathematics Subject Classification ID

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

Cites Work

• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Constructing cospectral graphs

Cited In (31)

• The spectrum and metric dimension of Indu–Bala product of graphs
• Comparing large-scale graphs based on quantum probability theory
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
• Construction of simultaneous cospectral graphs for adjacency, Laplacian and normalized Laplacian matrices
• On the normalized Laplacians with some classical parameters involving graph transformations
• Some graphs are more strongly-isospectral than others
• Graphs whose normalized Laplacian has three eigenvalues
• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• A graph theoretical approach to states and unitary operations
• On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
• Constructing graphs which are permanental cospectral and adjacency cospectral
• A geometric construction of isospectral magnetic graphs
• A construction of cospectral graphs for the normalized Laplacian
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Domination and spectral graph theory
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
• A generalization of Fiedler's lemma and the spectra of \(H\)-join of graphs
• Constructing cospectral graphs by unfolding non-bipartite graphs
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• Spectra of graph operations based on splitting graph
• Spectra of partitioned matrices and the \(\mathcal{M}\)-join of graphs
• Graphs determined by their generalized characteristic polynomials
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• Constructing cospectral bipartite graphs
• The characteristic polynomial of a generalized join graph
• The normalized Laplacian polynomial of rooted product of graphs
• Differentiate data by higher-order structures
• Title not available (Why is that?)
• On the construction of cospectral nonisomorphic bipartite graphs

This page was built for publication: A note about cospectral graphs for the adjacency and normalized Laplacian matrices

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