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.
Fibrations of graphs
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
A CERN-derived lab prototype with Z5 zeolite adsorbent captures CH4 down to 0.1% concentration and uses negative-exponential extrapolation to model performance at 10-100 ppm barn levels.
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.
The authors connect k-coloured Motzkin paths to odd-height prefixes and supply a linear-time random generation algorithm.
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.
-
Application of LHC Gas Recuperation Systems for Methane Emission Control in Livestock Housing
A CERN-derived lab prototype with Z5 zeolite adsorbent captures CH4 down to 0.1% concentration and uses negative-exponential extrapolation to model performance at 10-100 ppm barn levels.
-
Unfoldings and coverings of weighted graphs
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.
-
Random Generation of $k$-coloured Motzkin Paths
The authors connect k-coloured Motzkin paths to odd-height prefixes and supply a linear-time random generation algorithm.