On the domination number of Hamiltonian graphs with minimum degree six

被引：0
|
作者：
Xing, Hua-Ming [1 ,2 ]
Hattingh, Johannes H. [3 ]
Plummer, Andrew R. [3 ]
机构：
[1] Tianjin Univ Sci & Technol, Sch Sci, Tianjin 300457, Peoples R China
[2] Langfang Normal Coll, Dept Math, Langfang 065000, Hebei, Peoples R China
[3] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USA
来源：
APPLIED MATHEMATICS LETTERS | 2008年 / 21卷 / 10期
关键词：
domination; Hamiltonian graph; degree six;
D O I：
10.1016/j.aml.2007.10.023
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G = (V, E) be a simple graph. A set D subset of 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 gamma(G), is the mini mum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with mini mum degree at least six, then gamma(G) <= 6n/17. (C) Elsevier Ltd. All rights reserved.
引用
收藏
页码：1037 / 1040
页数：4
相关论文
共 50 条
12345