On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
From MaRDI portal
Publication:5043679
Abstract: In [Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387-390, 2010.], Butler constructed a family of bipartite graphs, which are cospectral for both the adjacency and the normalized Laplacian matrices. In this article, we extend this construction for generating larger classes of bipartite graphs, which are cospectral for both the adjacency and the normalized Laplacian matrices. Also, we provide a couple of constructions of non-bipartite graphs, which are cospectral for the adjacency matrices but not necessarily for the normalized Laplacian matrices.
Recommendations
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- On the construction of cospectral nonisomorphic bipartite graphs
- A construction of cospectral graphs for the normalized Laplacian
- Constructing cospectral bipartite graphs
- Cospectral constructions for several graph matrices using cousin vertices
Cites work
- scientific article; zbMATH DE number 3411062 (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
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Constructing cospectral graphs
- Developments on spectral characterizations of graphs
- Enumeration of cospectral graphs.
- Spectra of graphs
- Which graphs are determined by their spectrum?
Cited in
(13)- Cospectral constructions for several graph matrices using cousin vertices
- Using twins and scaling to construct cospectral graphs for the normalized Laplacian
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Constructing cospectral bipartite graphs
- Construction of simultaneous cospectral graphs for adjacency, Laplacian and normalized Laplacian matrices
- Constructing non-isomorphic signless Laplacian cospectral graphs
- A construction of cospectral graphs for the normalized Laplacian
- Constructing cospectral graphs by unfolding non-bipartite graphs
- Constructing graphs which are permanental cospectral and adjacency cospectral
- A cospectral family of graphs for the normalized Laplacian found by toggling
- scientific article; zbMATH DE number 15498 (Why is no real title available?)
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- On the construction of cospectral nonisomorphic bipartite graphs
This page was built for publication: On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043679)