The independence attractor of a graph is never a circle, and any line-segment attractor must be [−4/k, 0] for k = 1, 2, 3, 4, all realized with independence number four.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Circles and line segments as independence attractors of graphs
The independence attractor of a graph is never a circle, and any line-segment attractor must be [−4/k, 0] for k = 1, 2, 3, 4, all realized with independence number four.