Constructing Families of Cospectral Regular Graphs
Combinatorics
2021-10-12 v1
Abstract
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.
Cite
@article{arxiv.2110.04985,
title = {Constructing Families of Cospectral Regular Graphs},
author = {Michael Haythorpe and Alex Newcombe},
journal= {arXiv preprint arXiv:2110.04985},
year = {2021}
}
Comments
10 pages, 4 figures