Constructing cospectral graphs via a new form of graph product

DOI10.1080/03081087.2017.1373733zbMath1392.05076OpenAlexW2751369025MaRDI QIDQ4580053

Dan Vilenchik, Michael Langberg

Publication date: 13 August 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1373733

zbMATH Keywords

cospectral graphsgraph product

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Unnamed Item, Correlation matrices of Gaussian Markov random fields over cycle graphs, Cospectral bipartite graphs with the same degree sequences but with different number of large cycles

Cites Work

• Generalized spectral characterization of graphs revisited
• Spectra of coronae
• Constructing cospectral graphs
• Distinguishing graphs by their left and right homomorphism profiles
• A construction of cospectral graphs for the normalized Laplacian
• Spektren endlicher Grafen
• An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
• Explicit construction of linear sized tolerant networks
• Which graphs are determined by their spectrum?
• Contraction-deletion invariants for graphs
• A sufficient condition for a family of graphs being determined by their generalized spectra
• On the corona of two graphs
• Spectra of the neighbourhood corona of two graphs
• 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
• Operations with structures
• Large families of cospectral graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item