Network realignment complexes over arbitrary connected graphs admit an equivariant deformation retraction onto a complete graph plus discrete space; for complete graphs, diameter bounds and Aut(X_n) ≅ S_n (n≥5) are established.
Spanning Trees: A Survey
1 Pith paper cite this work, alongside 113 external citations. Polarity classification is still indexing.
1
Pith paper citing it
113
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Network Realignment Complexes over General Graphs
Network realignment complexes over arbitrary connected graphs admit an equivariant deformation retraction onto a complete graph plus discrete space; for complete graphs, diameter bounds and Aut(X_n) ≅ S_n (n≥5) are established.