A note about cospectral graphs for the adjacency and normalized Laplacian matrices
From MaRDI portal
Publication:3564201
DOI10.1080/03081080902722741zbMath1187.05046OpenAlexW2009878382MaRDI QIDQ3564201
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
Related Items
Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude, On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices, The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains, A graph theoretical approach to states and unitary operations, On the construction of cospectral nonisomorphic bipartite graphs, The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications, The spectrum and metric dimension of Indu–Bala product of graphs, Graphs determined by their generalized characteristic polynomials, A geometric construction of isospectral magnetic graphs, Differentiate data by higher-order structures, Spectra of partitioned matrices and the \(\mathcal{M}\)-join of graphs, On the normalized Laplacians with some classical parameters involving graph transformations, On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph, The characteristic polynomial of a generalized join graph, Graphs whose normalized Laplacian has three eigenvalues, Comparing large-scale graphs based on quantum probability theory, The normalized Laplacian polynomial of rooted product of graphs, Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains, A generalization of Fiedler's lemma and the spectra of \(H\)-join of graphs, Domination and Spectral Graph Theory, Constructing cospectral bipartite graphs
Cites Work
