Graph isomorphism and multivariate graph spectrum
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911277075398656 |
|---|---|
| author | Wang, Wei Zhao, Da |
| author_facet | Wang, Wei Zhao, Da |
| contents | We provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach suggests that almost all graphs are identified by their generalized block Laplacian spectrum. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_20016 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Graph isomorphism and multivariate graph spectrum Wang, Wei Zhao, Da Combinatorics 05C50, 05C60 We provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach suggests that almost all graphs are identified by their generalized block Laplacian spectrum. |
| title | Graph isomorphism and multivariate graph spectrum |
| topic | Combinatorics 05C50, 05C60 |
| url | https://arxiv.org/abs/2412.20016 |