A cycle C of a graph G is dominating if $V(C)$ is a dominating set and $V(G)\backslash V(C)$ is an independent set. Wu et al. [‘Degree sums and dominating cycles’, Discrete Mathematics 344 (2021), Article no. 112224] proved that every longest cycle of a k-connected graph G on $n\geq 3$ vertices with $k\geq 2$ is dominating if the degree sum is more than $(k+1)(n+1)/3$ for any $k+1$ pairwise nonadjacent vertices. They also showed that this bound is sharp. In this paper, we show that the extremal graphs G for this condition satisfy $(n-2)/3K_1\vee (n+1)/3K_2 \subseteq G \subseteq K_{(n-2)/3}\vee (n+1)/3K_2$ or $2K_1\vee 3K_{(n-2)/3}\subseteq G \subseteq K_2\vee 3K_{(n-2)/3}.$

Let G be a graph with no isolated vertex. A semitotal forcing set of G is a (zero) forcing set S such that every vertex in S is within distance 2 of another vertex of S. The semitotal forcing number $F_{t2}(G)$ is the minimum cardinality of a semitotal forcing set in G. In this paper, we prove that it is NP-complete to determine the semitotal forcing number of a graph. We also prove that if $G\neq K_n$ is a connected graph of order $n\geq 4$ with maximum degree $\Delta \geq 2$, then $F_{t2}(G)\leq (\Delta-1)n/\Delta$, with equality if and only if either $G=C_{4}$ or $G=P_{4}$ or $G=K_{\Delta ,\Delta }$.

Let $G$ be a connected graph with vertex set $V\left( G \right)$.The degree Kirchhoff index of $G$ is defined as ${{S}^{\prime }}\left( G \right)\,=\,\sum{_{\left\{ u,v \right\}\,\subseteq \,V\left( G \right)}d\left( u \right)d\left( v \right)R\left( u,\,v \right)}$, where $d\left( u \right)$ is the degree of vertex $u$, and $R\left( u,\,v \right)$ denotes the resistance distance between vertices $u$ and $v$. In this paper, we characterize the graphs having maximum and minimum degree Kirchhoff index among all $n$-vertex bicyclic graphs with exactly two cycles.