Point-set domatic numbers of graphs

@article{Zelinka1999,
abstract = {A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for each subset $S\subseteq V(G)-D$ there exists a vertex $v\in D$ such that the subgraph of $G$ induced by $S\cup \lbrace v\rbrace $ is connected. The maximum number of classes of a partition of $V(G)$, all of whose classes are point-set dominating sets, is the point-set domatic number $d_p(G)$ of $G$. Its basic properties are studied in the paper.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {dominating set; point-set dominating set; point-set domatic number; bipartite graph; dominating set; point-set dominating set; point-set domatic number; bipartite graph},
language = {eng},
number = {1},
pages = {77-82},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Point-set domatic numbers of graphs},
url = {http://eudml.org/doc/248451},
volume = {124},
year = {1999},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Point-set domatic numbers of graphs
JO - Mathematica Bohemica
PY - 1999
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 124
IS - 1
SP - 77
EP - 82
AB - A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for each subset $S\subseteq V(G)-D$ there exists a vertex $v\in D$ such that the subgraph of $G$ induced by $S\cup \lbrace v\rbrace $ is connected. The maximum number of classes of a partition of $V(G)$, all of whose classes are point-set dominating sets, is the point-set domatic number $d_p(G)$ of $G$. Its basic properties are studied in the paper.
LA - eng
KW - dominating set; point-set dominating set; point-set domatic number; bipartite graph; dominating set; point-set dominating set; point-set domatic number; bipartite graph
UR - http://eudml.org/doc/248451
ER -