A construction of cospectral graphs for the normalized Laplacian
From MaRDI portal
(Redirected from Publication:665752)
Abstract: We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix . We produce (exponentially) large families of non-bipartite, non-regular graphs which are mutually cospectral, and also give an example of a graph which is cospectral with its complement but is not self-complementary.
Recommendations
- A cospectral family of graphs for the normalized Laplacian found by toggling
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Using twins and scaling to construct cospectral graphs for the normalized Laplacian
- Constructing cospectral bipartite graphs
Cited in
(33)- Cospectral constructions for several graph matrices using cousin vertices
- Using twins and scaling to construct cospectral graphs for the normalized Laplacian
- A family of graphs that are determined by their normalized Laplacian spectra
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
- The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Cospectral quantum graphs with Dirichlet conditions at pendant vertices
- Normalized Laplacian spectrum of complete multipartite graphs
- Constructing cospectral bipartite graphs
- Construction of simultaneous cospectral graphs for adjacency, Laplacian and normalized Laplacian matrices
- Graphs whose normalized Laplacian has three eigenvalues
- The normalized distance Laplacian
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Distinguishing cospectral quantum graphs by scattering
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
- On the normalized Laplacians with some classical parameters involving graph transformations
- Cospectrality of graphs with respect to distance matrices
- Normalized Laplacian spectrum of some subdivision-joins and \(R\)-joins of two regular graphs
- Isospectral graphs via inner symmetries
- Constructing cospectral graphs by unfolding non-bipartite graphs
- A cospectral family of graphs for the normalized Laplacian found by toggling
- Hodge Laplacians on graphs
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Recovering the shape of a quantum graph
- Normalized Laplacian spectrum of different type of coronas of two regular graphs
- The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
- Two Laplacians for the distance matrix of a graph
- A geometric construction of isospectral magnetic graphs
- Constructing cospectral graphs via a new form of graph product
- A graph theoretical approach to states and unitary operations
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
- Spectral theory of the non-backtracking Laplacian for graphs
- On the construction of cospectral nonisomorphic bipartite graphs
This page was built for publication: A construction of 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 Q665752)
