Let G = (V(G), E(G)) be a graph. The complement of G is denoted by Gc. The forgotten topological index of G, denoted F(G), is defined as the sum of the cubes of the degrees of all the vertices in G. The second Zagreb index of G, denoted M2(G), is defined as the sum of the products of the degrees of pairs of adjacent vertices in G. A graph Gisk-Hamiltonian if for all X ⊂V(G) with|X| ≤ k, the subgraph induced byV(G) - Xis Hamiltonian. Clearly, G is 0-Hamiltonian if and only if G is Hamiltonian. A graph Gisk-path-coverableifV(G) can be covered bykor fewer vertex-disjoint paths. Using F(Gc) and M2(Gc), Li obtained several sufficient conditions for Hamiltonian and traceable graphs (Rao Li, Topological Indexes and Some Hamiltonian Properties of Graphs). In this chapter, the author presents sufficient conditions based upon F(Gc) and M2(Gc)for k-Hamiltonian, k-edge-Hamiltonian, k-path-coverable, k-connected, and k-edge-connected graphs.