We explore the extremal problems of the hitting time of unicyclic graphs on n vertices with a given diameter. Let HG (u, v) be the expected hitting time from vertex u to vertex v on a simple graph G. Let? (G) = maxₔₕ{? V (G) }, HG (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.
Zhu et al. (Wed,) studied this question.