On domination number of 4-regular graphs
Czechoslovak Mathematical Journal, Tome 54 (2004) no. 4, pp. 889-898
Let $G$ be a simple graph. A subset $S \subseteq V$ is a dominating set of $G$, if for any vertex $v \in V~- S$ there exists a vertex $u \in S$ such that $uv \in E (G)$. The domination number, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set. In this paper we prove that if $G$ is a 4-regular graph with order $n$, then $\gamma (G) \le \frac{4}{11}n$.
Let $G$ be a simple graph. A subset $S \subseteq V$ is a dominating set of $G$, if for any vertex $v \in V~- S$ there exists a vertex $u \in S$ such that $uv \in E (G)$. The domination number, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set. In this paper we prove that if $G$ is a 4-regular graph with order $n$, then $\gamma (G) \le \frac{4}{11}n$.
@article{CMJ_2004_54_4_a5,
author = {Liu, Hailong and Sun, Liang},
title = {On domination number of 4-regular graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {889--898},
year = {2004},
volume = {54},
number = {4},
mrnumber = {2100002},
zbl = {1080.05524},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2004_54_4_a5/}
}
Liu, Hailong; Sun, Liang. On domination number of 4-regular graphs. Czechoslovak Mathematical Journal, Tome 54 (2004) no. 4, pp. 889-898. http://geodesic.mathdoc.fr/item/CMJ_2004_54_4_a5/
[1] T. W. Haynes, S. T. Hedetniemi and P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker, 1998. | MR
[2] W. McGuaig and B. Shepherd: Domination in graphs with minimum degree two. J. Graph Theory 13 (1989), 749–762. | MR
[3] O. Ore: Theory of Graphs. Amer. Math. Soc. Colloq. Publ. (AMS, Providence, RI) 38 (1962). | MR | Zbl
[4] B. Reed: Paths, stars, and the number three. Comb. Prob. Comp. 5 (1996), 277–295. | DOI | MR | Zbl