A note on the domination number of a graph and its complement
Mathematica Bohemica, Tome 126 (2001) no. 1, pp. 63-65
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR Zbl
If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its complement, we show that the domination numbers of $G$ and $\overline{G}$ satisfy \[ \gamma (G) + \gamma (\overline{G}) \le \left\rbrace \begin{array}{ll}n-\delta + 2 \quad \text{if} \quad \gamma (G) > 3, \delta + 3 \quad \text{if} \quad \gamma (\overline{G}) > 3, \end{array}\right.\] where $\delta $ is the minimum degree of vertices in $G$.
If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its complement, we show that the domination numbers of $G$ and $\overline{G}$ satisfy \[ \gamma (G) + \gamma (\overline{G}) \le \left\rbrace \begin{array}{ll}n-\delta + 2 \quad \text{if} \quad \gamma (G) > 3, \delta + 3 \quad \text{if} \quad \gamma (\overline{G}) > 3, \end{array}\right.\] where $\delta $ is the minimum degree of vertices in $G$.
DOI :
10.21136/MB.2001.133925
Classification :
05C40, 05C69
Keywords: graphs; domination number; graph’s complement; complement
Keywords: graphs; domination number; graph’s complement; complement
Marcu, Dănuţ. A note on the domination number of a graph and its complement. Mathematica Bohemica, Tome 126 (2001) no. 1, pp. 63-65. doi: 10.21136/MB.2001.133925
@article{10_21136_MB_2001_133925,
author = {Marcu, D\u{a}nu\c{t}},
title = {A note on the domination number of a graph and its complement},
journal = {Mathematica Bohemica},
pages = {63--65},
year = {2001},
volume = {126},
number = {1},
doi = {10.21136/MB.2001.133925},
mrnumber = {1826471},
zbl = {0977.05097},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2001.133925/}
}