Antidomatic number of a graph

Zelinka, Bohdan. "Antidomatic number of a graph." Archivum Mathematicum 033.3 (1997): 191-195. <http://eudml.org/doc/18496>.

@article{Zelinka1997,
abstract = {A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called dominating in $G$, if for each $x\in V(G)-D$ there exists $y\in D$ adjacent to $x$. An antidomatic partition of $G$ is a partition of $V(G)$, none of whose classes is a dominating set in $G$. The minimum number of classes of an antidomatic partition of $G$ is the number $\bar\{d\} (G)$ of $G$. Its properties are studied.},
author = {Zelinka, Bohdan},
journal = {Archivum Mathematicum},
keywords = {dominating set; antidomatic partition; antidomatic number; dominating set; antidomatic partition; antidomatic number},
language = {eng},
number = {3},
pages = {191-195},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {Antidomatic number of a graph},
url = {http://eudml.org/doc/18496},
volume = {033},
year = {1997},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Antidomatic number of a graph
JO - Archivum Mathematicum
PY - 1997
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 033
IS - 3
SP - 191
EP - 195
AB - A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called dominating in $G$, if for each $x\in V(G)-D$ there exists $y\in D$ adjacent to $x$. An antidomatic partition of $G$ is a partition of $V(G)$, none of whose classes is a dominating set in $G$. The minimum number of classes of an antidomatic partition of $G$ is the number $\bar{d} (G)$ of $G$. Its properties are studied.
LA - eng
KW - dominating set; antidomatic partition; antidomatic number; dominating set; antidomatic partition; antidomatic number
UR - http://eudml.org/doc/18496
ER -