An upper bound for domination number of 5-regular graphs

Xing, Hua Ming, Sun, Liang, and Chen, Xue-Gang. "An upper bound for domination number of 5-regular graphs." Czechoslovak Mathematical Journal 56.3 (2006): 1049-1061. <http://eudml.org/doc/31090>.

@article{Xing2006,
abstract = {Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if for any vertex $u\in V-S$, there exists a vertex $v\in S$ such that $uv\in E$. The domination number, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set. In this paper we will prove that if $G$ is a 5-regular graph, then $\gamma (G)\le \{5\over 14\}n$.},
author = {Xing, Hua Ming, Sun, Liang, Chen, Xue-Gang},
journal = {Czechoslovak Mathematical Journal},
keywords = {domination number; 5-regular graph; upper bounds; domination number; 5-regular graph; upper bounds},
language = {eng},
number = {3},
pages = {1049-1061},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {An upper bound for domination number of 5-regular graphs},
url = {http://eudml.org/doc/31090},
volume = {56},
year = {2006},
}

TY - JOUR
AU - Xing, Hua Ming
AU - Sun, Liang
AU - Chen, Xue-Gang
TI - An upper bound for domination number of 5-regular graphs
JO - Czechoslovak Mathematical Journal
PY - 2006
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 56
IS - 3
SP - 1049
EP - 1061
AB - Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if for any vertex $u\in V-S$, there exists a vertex $v\in S$ such that $uv\in E$. The domination number, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set. In this paper we will prove that if $G$ is a 5-regular graph, then $\gamma (G)\le {5\over 14}n$.
LA - eng
KW - domination number; 5-regular graph; upper bounds; domination number; 5-regular graph; upper bounds
UR - http://eudml.org/doc/31090
ER -