For Sierpinski polygon graphs with r not a multiple of 4, isomorphism is classified by a dihedral group action on the defining sequence, and eventually-constant sequences yield exactly two Busemann and countably many non-Busemann horofunctions.
The independence polynomial on recursive sequences of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are uniformly bounded. Each of the recursion algorithms leads to a rational dynamical system whose formula, degree and the dimension of the space it acts upon depend on the specific algorithm. Nevertheless, we demonstrate that the qualitative behavior of the dynamics exhibit universal features that can be exploited to draw conclusions about the zero sets.
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Horofunctions of infinite Sierpinski polygon graphs
For Sierpinski polygon graphs with r not a multiple of 4, isomorphism is classified by a dihedral group action on the defining sequence, and eventually-constant sequences yield exactly two Busemann and countably many non-Busemann horofunctions.