Maximal hitting times for random walks on bicyclic graphs with a given number of pendant vertices
Sign Up to like & getrecommendations! Published in 2025 at "Filomat"
DOI: 10.2298/fil2513507z
Abstract: Let HG (x, y) be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and ?(G) = max,y?V(G)xG H (x, y). Lettn G be… read more here.
Keywords: maximal hitting; hitting times; pendant vertices; graphs ... See more keywords