Signed 2-domination in caterpillars

Zelinka, Bohdan. "Signed 2-domination in caterpillars." Mathematica Bohemica 129.4 (2004): 393-398. <http://eudml.org/doc/249399>.

@article{Zelinka2004,
abstract = {A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_\{\mathrm \{s\}\}(G)$ and the signed total 2-domination number $\gamma ^2_\{\mathrm \{st\}\}(G)$ of a graph $G$ are variants of the signed domination number $\gamma _\{\mathrm \{s\}\}(G)$ and the signed total domination number $\gamma _\{\mathrm \{st\}\}(G)$. Their values for caterpillars are studied.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {caterpillar; signed 2-domination number; signed total 2-domination number; caterpillar; signed 2-domination number; signed total 2-domination number},
language = {eng},
number = {4},
pages = {393-398},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Signed 2-domination in caterpillars},
url = {http://eudml.org/doc/249399},
volume = {129},
year = {2004},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Signed 2-domination in caterpillars
JO - Mathematica Bohemica
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 129
IS - 4
SP - 393
EP - 398
AB - A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_{\mathrm {s}}(G)$ and the signed total 2-domination number $\gamma ^2_{\mathrm {st}}(G)$ of a graph $G$ are variants of the signed domination number $\gamma _{\mathrm {s}}(G)$ and the signed total domination number $\gamma _{\mathrm {st}}(G)$. Their values for caterpillars are studied.
LA - eng
KW - caterpillar; signed 2-domination number; signed total 2-domination number; caterpillar; signed 2-domination number; signed total 2-domination number
UR - http://eudml.org/doc/249399
ER -