The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Minimally (p-6)-Hamiltonian Graphs


Affiliations
1 University of Bombay, India
2 Western Michigan University, United States
     

   Subscribe/Renew Journal


In view of the lack of a practical characterization of hamiltonian graphs, highly hamiltonian graphs were introduced in [2], and a graph G on p vertices was called n-hamiltonian, 0 ≤ n ≤ p-3, if all the graphs obtained by removing at most n vertices from G are hamiltonian.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 231

PDF Views: 0




  • Minimally (p-6)-Hamiltonian Graphs

Abstract Views: 231  |  PDF Views: 0

Authors

Vasanti N. Bhat
University of Bombay, India
S. F. Kapoor
Western Michigan University, United States

Abstract


In view of the lack of a practical characterization of hamiltonian graphs, highly hamiltonian graphs were introduced in [2], and a graph G on p vertices was called n-hamiltonian, 0 ≤ n ≤ p-3, if all the graphs obtained by removing at most n vertices from G are hamiltonian.