Cospectral pairs of regular graphs with different connectivity

2019/04/11 by Haemers, Willem H.
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1904.05936

Abstract

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

Related

• Constructing Families of Cospectral Regular Graphs
• Cospectral regular graphs with and without a perfect matching
• Finding singularly cospectral graphs
• On Cospectral Graphons
• A construction of distance cospectral graphs