Some graphs are more strongly-isospectral than others

zbMATH Open1265.05406MaRDI QIDQ4899896FDOQ4899896

Authors: Milan Randić, Boris Horvat, Tomaž Pisanski 

Publication date: 10 January 2013

Recommendations

• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• Cospectral constructions for several graph matrices using cousin vertices
• A class of cospectral graphs.
• Towards an algebra of SINGs
• Enumeration of cospectral graphs.

zbMATH Keywords

cospectral graphsgraph matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cited In (1)

• Rank of Hadamard powers of Euclidean distance matrices

This page was built for publication: Some graphs are more strongly-isospectral than others

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899896)