| Title:
|
Signed 2-domination in caterpillars (English) |
| Author:
|
Zelinka, Bohdan |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
129 |
| Issue:
|
4 |
| Year:
|
2004 |
| Pages:
|
393-398 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
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. (English) |
| Keyword:
|
caterpillar |
| Keyword:
|
signed 2-domination number |
| Keyword:
|
signed total 2-domination number |
| MSC:
|
05C05 |
| MSC:
|
05C69 |
| idZBL:
|
Zbl 1080.05525 |
| idMR:
|
MR2102612 |
| DOI:
|
10.21136/MB.2004.134049 |
| . |
| Date available:
|
2009-09-24T22:16:41Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/134049 |
| . |
| Reference:
|
[1] A. Recski: Maximal results and polynomial algorithms in VLSI routing.Combinatorics, Graphs, Complexity. Proc. Symp. Prachatice, 1990. JČMF Praha, 1990. |
| Reference:
|
[2] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs.Marcel Dekker, New York, 1998. MR 1605684 |
| . |
