Let G = (V(G), E(G)) be a graph. A set S subset of V(G) is a dominating set if every vertex of V(G) - S is adjacent to some vertices in S. The domination number gamma(G) of G is the minimum cardinality of a dominating set of G. In this paper, we study the domination number of generalized Petersen graphs P(n, 3) and proved that gamma(P(n, 3)) = n - 2[n/4] (n not equal 11).
机构:
Langfang Teachers Univ, Dept Math & Info Sci, Langfang 065000, Peoples R ChinaLangfang Teachers Univ, Dept Math & Info Sci, Langfang 065000, Peoples R China
Li, Wensheng
Xing, Huaming
论文数: 0引用数: 0
h-index: 0
机构:
Tianjin Univ Sci & Technol, Coll Sci, Tianjin 300222, Peoples R ChinaLangfang Teachers Univ, Dept Math & Info Sci, Langfang 065000, Peoples R China
Xing, Huaming
Huang, Zhongsheng
论文数: 0引用数: 0
h-index: 0
机构:
Langfang Teachers Univ, Dept Math & Info Sci, Langfang 065000, Peoples R ChinaLangfang Teachers Univ, Dept Math & Info Sci, Langfang 065000, Peoples R China
机构:
Langfang Normal Coll, Dept Math & Informat Sci, Langfang 065000, Peoples R ChinaLangfang Normal Coll, Dept Math & Informat Sci, Langfang 065000, Peoples R China
Li, Wen-Sheng
Xing, Hua-Ming
论文数: 0引用数: 0
h-index: 0
机构:
Tianjin Univ Sci & Technol, Sch Sci, Tianjin 300222, Peoples R ChinaLangfang Normal Coll, Dept Math & Informat Sci, Langfang 065000, Peoples R China