Let \(\varphi (G)=\max \{ H_G(x, y)| x, y\in V(G)\}\) denote the hitting time of G, where \(H_G(x, y)\) represents the expected hitting time from vertex x to vertex y in a simple connected graph G. We investigate extremal problems related to hitting time on unicyclic graphs with a given maximum degree. We examine how the hitting time is affected by graph transformations. By employing graph grafting techniques to increase the hitting time of graphs, we establish a sharp upper bound for the hitting time of unicyclic graphs with a given maximum degree and identify the corresponding extremal graph.
