Number of spanning trees in a wheel graph with two identified vertices via hitting times
Discrete Applied Mathematics · 2026-07 · 387 · 318-336
DOI: 10.1016/j.dam.2026.03.030 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Shunya Tamura und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science.
Abstract (Originalsprache)
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.
Förderung
- Japan Society for the Promotion of Science
Zitieren
APA
Tamura, S., & Tanaka, Y. (2026). Number of spanning trees in a wheel graph with two identified vertices via hitting times. Discrete Applied Mathematics, 387, 318-336. https://doi.org/10.1016/j.dam.2026.03.030
Vancouver
Tamura S, Tanaka Y. Number of spanning trees in a wheel graph with two identified vertices via hitting times. Discrete Applied Mathematics. 2026;387:318-336. doi:10.1016/j.dam.2026.03.030
BibTeX
@article{Tamura2026,
author = {Tamura, Shunya and Tanaka, Yuuho},
title = {Number of spanning trees in a wheel graph with two identified vertices via hitting times},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {387},
pages = {318--336},
doi = {10.1016/j.dam.2026.03.030}
}
EUVIMED