An upper bound for domination number of 5-regular graphs

被引：0

作者：

Hua-Ming Xing

Liang Sun

Xue-Gang Chen

机构：

[1] Langfang Teachers College,Dept. of Mathematics

[2] Beijing Institute of Technology,Dept. of Mathematics

[3] Shandong University of Sci. & Tech.,College of Info. Sci. & Eng.

来源：

Czechoslovak Mathematical Journal | 2006年 / 56卷

关键词：

domination number; 5-regular graph; upper bounds;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let G = (V, E) be a simple graph. A subset S ⊆ V is a dominating set of G, if for any vertex u ∈ V-S, there exists a vertex v ∈ S such that uv ∈ E. The domination number, denoted by γ(G), is the minimum cardinality of a dominating set. In this paper we will prove that if G is a 5-regular graph, then γ(G) ⩽ 5/14n.

引用

页码：1049 / 1061

页数：12

共 9 条

[1]

Caro Y.(1985)On the vertex-independence number and star decomposition of graphs Ars Combin. 20 167-180

[2]

Roditty Y.(1990)A note on the Internat. J. Math. Sci. 13 205-206

[3]

Caro Y.(2004)-domination number of a graph Czechoslovak Math. J. 54 889-898

[4]

Roditty Y.(1989)On domination number of 4-regular graphs J. Graph Theory 13 749-762

[5]

Liu H.(1996)Domination in graphs with minimum degree two Comb. Prob. Comp. 5 277-295

[6]

Sun L.(undefined)Paths, stars, and the number three undefined undefined undefined-undefined

[7]

McGuaig W.(undefined)undefined undefined undefined undefined-undefined

[8]

Shepherd B.(undefined)undefined undefined undefined undefined-undefined

[9]

Reed B.(undefined)undefined undefined undefined undefined-undefined

← 1 →