Abstract
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
| Original language | English |
|---|---|
| Place of Publication | Ithaca |
| Publisher | Cornell University Library |
| Publication status | Published - 11 Apr 2019 |
Publication series
| Name | arXiv |
|---|---|
| Volume | 1904.05936 |