Hitting times for random walks on tricyclic graphs
| Autor: | Xiao-Min Zhu, Xu Yang |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 65-72 (2023) |
| Druh dokumentu: | article |
| ISSN: | 09728600 2543-3474 0972-8600 |
| DOI: | 10.1080/09728600.2023.2182244 |
| Popis: | AbstractLet G be a simple connected graph and [Formula: see text] Let [Formula: see text] be the expected hitting time from x to y in G and [Formula: see text] be the hitting time of G, where [Formula: see text] A tricyclic graph is a simple connected graph that the edge number equals the vertex number plus two. Let [Formula: see text] be the set of all n-vertex tricyclic graphs. In this article, we will determine the extremal graphs for hitting times among all n-vertex tricyclic graphs. Moreover, if [Formula: see text] then we will obtain sharp upper and lower bounds for [Formula: see text] |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|