Hitting times for random walks on tricyclic graphs

Hitting times for random walks on tricyclic graphs

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 num...

Full description

Bibliographic Details
Main Authors: Xiao-Min Zhu, Xu Yang
Format: Article
Language:English
Published: Taylor & Francis Group 2023-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Hitting time
tricyclic graph
random walks
05C81
05C35
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2023.2182244

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2023.2182244

Similar Items