Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.
Journal of Pure and Applied Algebra , volume=
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
-
Relative accessibility for graphs
Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.