We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Constructing families of cospectral regular graphs.
- Authors
Haythorpe, M.; Newcombe, A.
- 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.
- Subjects
REGULAR graphs
- Publication
Combinatorics, Probability & Computing, 2020, Vol 29, Issue 5, p664
- ISSN
0963-5483
- Publication type
Article
- DOI
10.1017/S096354832000019X