Maximum hitting time of random walks on unicyclic graphs with given diameter
Filomat · 2025 · 39 (27) · 9579-9600
DOI: 10.2298/fil2527579z ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Xiao-Min Zhu und 2 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
We explore the extremal problems of the hitting time of unicyclic graphs on n vertices with a given diameter. Let \mathrm{H_G} (u, v) be the expected hitting time from vertex u to vertex v on a simple graph G. Let ?(G) = \mathrm{max_{u}{v}{?}{V}{(G)}} , \mathrm{H_G} (u,v) be the hitting time of G. In this paper, we obtain the upper bound for the hitting time of unicyclic graphs with a given diameter, and the extremal graph that attached the value is determined.
Zitieren
APA
Zhu, X., Jiang, X., & Yang, X. (2025). Maximum hitting time of random walks on unicyclic graphs with given diameter. Filomat, 39(27), 9579-9600. https://doi.org/10.2298/fil2527579z
Vancouver
Zhu X, Jiang X, Yang X. Maximum hitting time of random walks on unicyclic graphs with given diameter. Filomat. 2025;39(27):9579-9600. doi:10.2298/fil2527579z
BibTeX
@article{Zhu2025,
author = {Zhu, Xiao-Min and Jiang, Xun-Da and Yang, Xu},
title = {Maximum hitting time of random walks on unicyclic graphs with given diameter},
journal = {Filomat},
year = {2025},
volume = {39},
number = {27},
pages = {9579--9600},
doi = {10.2298/fil2527579z}
}
EUVIMED