Constructing cospectral graphs via a new form of graph product
From MaRDI portal
Publication:4580053
Recommendations
Cites work
- A construction of cospectral graphs for the normalized Laplacian
- A sufficient condition for a family of graphs being determined by their generalized spectra
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Constructing cospectral graphs
- Contraction-deletion invariants for graphs
- Distinguishing graphs by their left and right homomorphism profiles
- Explicit construction of linear sized tolerant networks
- Generalized spectral characterization of graphs revisited
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- scientific article; zbMATH DE number 3587083 (Why is no real title available?)
- scientific article; zbMATH DE number 3623609 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Large families of cospectral graphs
- On the corona of two graphs
- Operations with structures
- Pseudo-random graphs
- Spectra of coronae
- Spectra of the neighbourhood corona of two graphs
- Spektren endlicher Grafen
- The Kronecker Product of Graphs
- The Spectrum of the Corona of Two Graphs
- Using twins and scaling to construct cospectral graphs for the normalized Laplacian
- Which graphs are determined by their spectrum?
Cited in
(11)- Constructing graphs which are permanental cospectral and adjacency cospectral
- On the construction of cospectral nonisomorphic bipartite graphs
- Construction of cospectral graphs
- Cospectral constructions for several graph matrices using cousin vertices
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Correlation matrices of Gaussian Markov random fields over cycle graphs
- Constructing cospectral graphs
- Construction of graphs with distinct eigenvalues
- Complementarity eigenvalues and graph determination
- Constructing cospectral graphs via exotic graph products
- Constructing cospectral bipartite graphs
This page was built for publication: Constructing cospectral graphs via a new form of graph product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580053)