Metrics
101 File views/ downloads
69 Record Views
Thesis
DEGREE SUM ENSURING HAMILTONICITY
University of West Florida
Master of Science (MS), University of West Florida
2007
Abstract
After investigating several existing necessary and sufficient conditions, we prove that if a graph G is 1-tough with n >= 3 vertices such that d(u) + d(v) + d(w) >= max{n, n + k − 3} holds for any three independent vertices u, v, w of G, where k is the vertex connectivity, then G is Hamiltonian.
Details
- Title
- DEGREE SUM ENSURING HAMILTONICITY
- Resource Type
- Thesis
- Publisher
- University of West Florida
- Format
- text
- Copyright
- http://rightsstatements.org/vocab/InC-EDU/1.0/
- Identifiers
- 99380090746706600
- Academic Unit
- Mathematics and Statistics
- Language
- English
- Awarding Institution
- University of West Florida; Master of Science (MS)
- Theses and Dissertations
- Master of Science (MS), University of West Florida