Linear binomials in colored Gaussian cycles correspond to graph symmetries for 3, 5, and 7-cycles, but this fails for all other cycle lengths, with a revised theorem for uniform edge colorings of odd cycles.
Coloured graphical models and their symmetries
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear relations of colored Gaussian cycles
Linear binomials in colored Gaussian cycles correspond to graph symmetries for 3, 5, and 7-cycles, but this fails for all other cycle lengths, with a revised theorem for uniform edge colorings of odd cycles.