Exact computation for the cover times of certain classes of trees
- Publication date
- Publisher
- 九州大学大学院数理学研究院
Abstract
We show a special feature for the cover time of trees that is not satisfied by those of other graphs. By using this property, we show the relationship between the cover times of a tree and its subdivision, and we compute exactly the distribution of the last vertex visited by a random walk, the expectation and the Laplace transform of cover times of spider graphs as integral representations. We also discuss some comparison results for spider graphs.MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・インダストリ教育研究拠点