Induced-paired domatic numbers of graphs
Mathematica Bohemica (2002)
- Volume: 127, Issue: 4, page 591-596
- ISSN: 0862-7959
Access Full Article
topAbstract
topHow to cite
topZelinka, Bohdan. "Induced-paired domatic numbers of graphs." Mathematica Bohemica 127.4 (2002): 591-596. <http://eudml.org/doc/249017>.
@article{Zelinka2002,
abstract = {A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called dominating in $G$, if each vertex of $G$ either is in $D$, or is adjacent to a vertex of $D$. If moreover the subgraph $<D>$ of $G$ induced by $D$ is regular of degree 1, then $D$ is called an induced-paired dominating set in $G$. A partition of $V(G)$, each of whose classes is an induced-paired dominating set in $G$, is called an induced-paired domatic partition of $G$. The maximum number of classes of an induced-paired domatic partition of $G$ is the induced-paired domatic number $d_\{\text\{ip\}\}(G)$ of $G$. This paper studies its properties.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {dominating set; induced-paired dominating set; induced-paired domatic number; dominating set; induced-paired dominating set; induced-paired domatic number},
language = {eng},
number = {4},
pages = {591-596},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Induced-paired domatic numbers of graphs},
url = {http://eudml.org/doc/249017},
volume = {127},
year = {2002},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - Induced-paired domatic numbers of graphs
JO - Mathematica Bohemica
PY - 2002
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 127
IS - 4
SP - 591
EP - 596
AB - A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called dominating in $G$, if each vertex of $G$ either is in $D$, or is adjacent to a vertex of $D$. If moreover the subgraph $<D>$ of $G$ induced by $D$ is regular of degree 1, then $D$ is called an induced-paired dominating set in $G$. A partition of $V(G)$, each of whose classes is an induced-paired dominating set in $G$, is called an induced-paired domatic partition of $G$. The maximum number of classes of an induced-paired domatic partition of $G$ is the induced-paired domatic number $d_{\text{ip}}(G)$ of $G$. This paper studies its properties.
LA - eng
KW - dominating set; induced-paired dominating set; induced-paired domatic number; dominating set; induced-paired dominating set; induced-paired domatic number
UR - http://eudml.org/doc/249017
ER -
References
top- 10.1002/net.3230070305, Networks 7 (1977), 247–261. (1977) MR0483788DOI10.1002/net.3230070305
- Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998. (1998) MR1605684
- Induced-paired domination in graphs, Ars Combinatoria 57 (2000), 111–128. (2000) MR1796633
- Adomatic and idomatic numbers of graphs, Math. Slovaca 33 (1983), 99–103. (1983) Zbl0507.05059MR0689285
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.