Cospectral graphs obtained by edge deletion
<p>We show how to construct graphs which are simultaneously cospectral with respect to several symmetric matrices that encode adjacency. Our main operation consists of locating cliques in highly regular graphs (for example, strongly regular graphs) and removing edges in distinct ways preservin...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Published: |
2025
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!