On a Hierarchy of Spectral Invariants for Graphs
| Autor: | Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of the adjacency matrix. We provide a purely combinatorial characterization of this hierarchy in terms of the walk counts. This allows us to give a complete answer to F\"urer's question about the strength of his invariants in distinguishing non-isomorphic graphs in comparison to the 2-dimensional Weisfeiler-Leman algorithm, extending the recent work of Rattan and Seppelt (SODA 2023). As another application of the characterization, we prove that almost all graphs are determined up to isomorphism in terms of the spectrum and the angles, which is of interest in view of the long-standing open problem whether almost all graphs are determined by their eigenvalues alone. Finally, we describe the exact relationship between the hierarchy and the Weisfeiler-Leman algorithms for small dimensions, as also some other important spectral characteristics of a graph such as the generalized and the main spectra. Comment: 32 pages, 1 diagram, 1 figure. A preliminary version of this paper appeared in the Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS'24), published in LIPIcs Vol. 289, Schloss Dagstuhl, Leibniz-Zentrum f\"ur Informatik, 2024 |
| Databáze: | arXiv |
| Externí odkaz: |
|