On the domination number of Hamiltonian graphs with minimum degree six

Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then (G) 6n 17 .

• Type: Journal
• Year: 2008
• Where: APPML
• Authors: Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plummer
• Keywords: APPML 2008, Dominating Set, Domination Number, Simple Graph