Abstract
AbstractA 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference11 articles.
1. Cospectral Graphs and Regular Orthogonal Matrices of Level 2
2. The characteristic polynomials of modified graphs
3. Construction of cospectral regular graphs;Bapat;Mat. Vesnik,2016
4. Hamiltonian Cycle Problem and Markov Chains
5. Connected cospectral graphs are not necessarily both Hamiltonian;Filar;Aust. Math. Soc. Gaz.,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献