REVIEW 1 cited by
The independence polynomial on recursive sequences of graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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 ...
Discussion (0). Continue with ORCID to comment.