Every connected graph embeds isometrically into a Cayley graph of (Z_2)^k with k <= n-1 via new edge relations and a quotient labeling theorem, enabling group-based harmonic analysis on graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimal Isometric Embeddings of Graphs into Abelian Groups: Theory, Algorithms, and Applications to Signal Processing over Networks
Every connected graph embeds isometrically into a Cayley graph of (Z_2)^k with k <= n-1 via new edge relations and a quotient labeling theorem, enabling group-based harmonic analysis on graphs.