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

DOI10.1080/03081080902722741MaRDI QIDQ3564201zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adjacency matrixbipartitecospectralnormalized Laplacian

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(34)

• Constructing graphs which are permanental cospectral and adjacency cospectral
• The characteristic polynomial of a generalized join graph
• 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
• On the construction of cospectral nonisomorphic bipartite graphs
• Comparing large-scale graphs based on quantum probability theory
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• A graph theoretical approach to states and unitary operations
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Domination and spectral graph theory
• scientific article; zbMATH DE number 15498 (Why is no real title available?)
• Some graphs are more strongly-isospectral than others
• On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
• On the normalized Laplacians with some classical parameters involving graph transformations
• The normalized Laplacian polynomial of rooted product of graphs
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• Graphs whose normalized Laplacian has three eigenvalues
• The spectrum and metric dimension of Indu–Bala product of graphs
• A geometric construction of isospectral magnetic graphs
• Differentiate data by higher-order structures
• Spectra of partitioned matrices and the \(\mathcal{M}\)-join of graphs
• Graphs determined by their generalized characteristic polynomials
• Construction of simultaneous cospectral graphs for adjacency, Laplacian and normalized Laplacian matrices
• Constructing cospectral graphs by unfolding non-bipartite graphs
• Spectra of graph operations based on splitting graph
• A construction of cospectral graphs for the normalized Laplacian
• Cokernel statistics for walk matrices of directed and weighted random graphs
• Cospectral graphs obtained by edge deletion
• Isospectral graphs via spectral bracketing
• Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
• Constructing cospectral 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)