Construction of cospectral regular graphs
Keywords:
Eigenvalue, cospectral graphs, adjacency matrix, integral graphsSubjects:
05C50Abstract
Graphs $G$ and $H$ are called cospectral if theyhave the same characteristic polynomial, equivalently, if theyhave the same eigenvalues considering multiplicities. In thisarticle we introduce a construction to produce pairs ofcospectral regular graphs. We also investigate conditions underwhich the graphs are integral.
Downloads
Published
2016-01-15
Issue
Section
Articles
License
Copyright (c) 2016 Authors retain copyright to their work.
This work is licensed under a Creative Commons Attribution 4.0 International License.