Prefer a chat interface with context about you and your work?
Constructing families of cospectral regular graphs
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 …