Constructing cospectral bipartite graphs
From MaRDI portal
Recommendations
- On the construction of cospectral nonisomorphic bipartite graphs
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
- A construction of cospectral graphs for the normalized Laplacian
- Constructing cospectral graphs via a new form of graph product
Cites work
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Can One Hear the Shape of a Drum?
- Constructing cospectral graphs
- Developments on spectral characterizations of graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- On hearing the shape of a drum
- Riemannian coverings and isospectral manifolds
- Which graphs are determined by their spectrum?
Cited in
(8)- 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
- A construction of cospectral graphs for the normalized Laplacian
- When can the components of NEPS of connected bipartite graphs be almost cospectral?
- Constructing cospectral graphs by unfolding non-bipartite graphs
- Constructing cospectral graphs via a new form of graph product
- Construction of cospectral graphs
- On the construction of cospectral nonisomorphic bipartite graphs
This page was built for publication: Constructing cospectral bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785818)