Sciweavers

APPML
2008
92views more  APPML 2008»
13 years 12 months ago
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 min...
Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plu...