Disjoint cycles and \(2\)-factors with Fan-type condition in a graph (Q2075536)

Let \(G\) be a graph and \(d(v)\) the degree of a vertex \(v\) of \(G\). Two results on (spanning) disjoint cycles are proved in this work, both use the following parameter \[\sigma_1^2(G)=\min\{\max\{d(u),d(v)\}:u,v\in V(G),uv\notin E(G)\}.\] The first result concerns 2-connected graphs of order \(n\geq 3k+5\) for some positive integer \(k\). If \(\sigma_1^2(G)\geq\max\{n/2,2k+2\}\) for the mentioned graphs, then \(G\) contains a spanning subgraph that consists of exactly \(k\) disjoint cycles. The second result concerns graphs of order \(n\geq 3k+2\) for some positive integer \(k\). If \(\sigma_1^2(G)\geq 2k\) for the mentioned graphs, then \(G\) contains \(k\) disjoint cycles. The motivation for the use of \(\sigma_1^2(G)\) is nicely presented and his origin lies in the study of Hamiltonian graphs, which are the graphs with one spanning cycle.