Antidomatic number of a graph
Zelinka, Bohdan
Archivum Mathematicum, Tome 033 (1997), p. 191-195 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)

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.

Publié le : 1997-01-01
Classification:  05C35 
@article{107610,
     author = {Bohdan Zelinka},
     title = {Antidomatic number of a graph},
     journal = {Archivum Mathematicum},
     volume = {033},
     year = {1997},
     pages = {191-195},
     zbl = {0909.05031},
     mrnumber = {1478772},
     language = {en},
     url = {http://dml.mathdoc.fr/item/107610}
}

Zelinka, Bohdan. Antidomatic number of a graph. Archivum Mathematicum, Tome 033 (1997) pp. 191-195. http://gdmltest.u-ga.fr/item/107610/

Towards a theory of domination in graphs, Networks 7(1977), 247–261. | MR 0483788

Some numerical invariants of graphs, DrSc dissertation, Charles University, Prague 1988 (Czech).