Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.11523 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915447655366656 |
|---|---|
| author | Ihringer, Ferdinand Simoens, Robin |
| author_facet | Ihringer, Ferdinand Simoens, Robin |
| contents | We show that each (r, lambda)-design yields a class of switching methods that can be used produce cospectral graphs. We use this to explain several specific switching methods such as Godsil-McKay (GM) switching and Wang-Qiu-Hu (WQH) switching. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11523 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Design switching on graphs Ihringer, Ferdinand Simoens, Robin Combinatorics We show that each (r, lambda)-design yields a class of switching methods that can be used produce cospectral graphs. We use this to explain several specific switching methods such as Godsil-McKay (GM) switching and Wang-Qiu-Hu (WQH) switching. |
| title | Design switching on graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2508.11523 |