The k-th power of any connected n-vertex graph G satisfies b(G^k) ≤ ceil(sqrt(4(k-1)n/k^2)), proving the Burning Number Conjecture for all non-trivial graph powers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Burning Graph Powers and Branching Trees
The k-th power of any connected n-vertex graph G satisfies b(G^k) ≤ ceil(sqrt(4(k-1)n/k^2)), proving the Burning Number Conjecture for all non-trivial graph powers.