Cospectral pairs of regular graphs with different connectivity
Combinatorics
2019-09-12 v2
Abstract
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
Cite
@article{arxiv.1904.05936,
title = {Cospectral pairs of regular graphs with different connectivity},
author = {Willem H. Haemers},
journal= {arXiv preprint arXiv:1904.05936},
year = {2019}
}