























In this paper, we provide an exact formula for the average hitting times in a wheel graph $W_{N+1}$ using a combinatorial approach. For this wheel graph, the average hitting times can be expressed using Fibonacci numbers when the number of surrounding vertices is odd and Lucas numbers when it is even. Furthermore, combining the exact formula for the average hitting times with the general formula for the effective resistance of the graph allows determination of the number of spanning trees of the graph with two identified vertices.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。