Stability, Total Vertices, and Hamiltonian Cycles

A. Pawel Wojda1, Mariusz Woéniak1
1Instvtut Matematyki Akademia G6émiczo-Hutnicza Al. Mickiewicza 30 30-059 Krak6éw, Poland

Abstract

A known theorem of Bigalke and Jung says that the only nonhamiltonian, tough graph \(G\) with \(\alpha(G) \leq H(G) + 1\), where \(H(G) \geq 3\), is the Petersen graph. In this paper we characterize all nonhamiltonian, tough graphs having k total vertex (i.e. adjacent to all others) with \(\alpha(G) \leq k+ 2\) (Theorem 3).