Explicit formulas for average hitting times on cycle power graphs C_N^k are obtained as a quadratic term plus finitely many correction terms from second-order linear recurrences, unifying prior results for k=1 and k=2 while extending to higher powers and combinatorial invariants.
Chaiken, A combinatorial proof of the all minors matrix tree theorem,SIAM J
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
-
Average Hitting Times and Recurrence Structures I: Powers of Cycle Graphs
Explicit formulas for average hitting times on cycle power graphs C_N^k are obtained as a quadratic term plus finitely many correction terms from second-order linear recurrences, unifying prior results for k=1 and k=2 while extending to higher powers and combinatorial invariants.