On a Hierarchy of Spectral Isomorphism Invariants

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by Fürer (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 charact...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 34; číslo 2; s. 19
Hlavní autori:	Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.12.2025 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computational Mathematics and Numerical Analysis Computer Science Eigenvalues Graphs Invariants Isomorphism combinatorial refinement strongly regular graphs 68Q25 Graph isomorphism 68R10 spectra of graphs
ISSN:	1016-3328, 1420-8954
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!