Graph isomorphism and multivariate graph spectrum
Combinatorics
2025-11-21 v2
Abstract
We provide a criterion to distinguish two graphs which are indistinguishable by -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.
Cite
@article{arxiv.2412.20016,
title = {Graph isomorphism and multivariate graph spectrum},
author = {Wei Wang and Da Zhao},
journal= {arXiv preprint arXiv:2412.20016},
year = {2025}
}
Comments
20 pages, 1 figure