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.

中文翻译：

---

构建余谱正则图族

如果一组图的邻接矩阵具有相同的特征多项式，则称为协谱图。在本文中，我们介绍了一种构建无限多谱正则图族的简单方法。该构造适用于 Schwenk 介绍的财产的特殊情况。对于三次（3-正则）图的情况，给出的计算结果表明该构造生成了大部分三次图，这些三次图与另一个三次图是共谱的。