arXiv Analytics

Sign in

arXiv:1904.05936 [math.CO]AbstractReferencesReviewsResources

Cospectral pairs of regular graphs with different connectivity

Willem H. Haemers

Published 2019-04-11Version 1

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

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1203.6145 [math.CO] (Published 2012-03-28, updated 2012-04-30)
Incidence coloring of Regular graphs and Complement graphs
arXiv:1809.10761 [math.CO] (Published 2018-09-27)
The 1-2-3 Conjecture almost holds for regular graphs
arXiv:1102.5181 [math.CO] (Published 2011-02-25)
On the edge connectivity of direct products with dense graphs

Links

Toolbox