Journal of Information Science and Engineering, Vol. 38 No. 4, pp. 833-857

On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem

Any undirected and simple graph *G* = (*V*, *E*), where *V *and E denote the vertex set and the edge set of *G*, is called Hamiltonian if it contains a cycle that visits each vertex of *G* exactly once. Ore proved that *G* is Hamiltonian if *deg _{G}*(

Keywords:
degree, Ore’s condition, Hamiltonian, 1-vertex fault Hamiltonian, 2-vertex fault Hamiltonian