Derives exact hitting-time formulas for wheel graphs W_{N+1} in Fibonacci/Lucas numbers and uses them with effective resistance to obtain the spanning-tree count of the graph with two vertices identified.
: Fibonacci and Lucas Numbers with Applications, Volume 1 , Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tract s (2018) 23
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Number of spanning trees in a wheel graph with two identified vertices via hitting times
Derives exact hitting-time formulas for wheel graphs W_{N+1} in Fibonacci/Lucas numbers and uses them with effective resistance to obtain the spanning-tree count of the graph with two vertices identified.