Geodesic
Signed total domination number of a graph
Czechoslovak Mathematical Journal, Tome 51 (2001) no. 2, pp. 225-229 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$. A mapping $f: V(G) \rightarrow \lbrace -1, 1\rbrace $, where $V(G)$ is the vertex set of $G$, is called a signed total dominating function (STDF) on $G$, if $\sum _{x \in N(v)} f(x) \ge 1$ for each $v \in V(G)$. The minimum of values $\sum _{x \in V(G)} f(x)$, taken over all STDF’s of $G$, is called the signed total domination number of $G$ and denoted by $\gamma _{\mathrm st}(G)$. A theorem stating lower bounds for $\gamma _{\mathrm st}(G)$ is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on $n$-side prisms. At the end it is proved that $\gamma _{\mathrm st}(G)$ is not bounded from below in general.
The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$. A mapping $f: V(G) \rightarrow \lbrace -1, 1\rbrace $, where $V(G)$ is the vertex set of $G$, is called a signed total dominating function (STDF) on $G$, if $\sum _{x \in N(v)} f(x) \ge 1$ for each $v \in V(G)$. The minimum of values $\sum _{x \in V(G)} f(x)$, taken over all STDF’s of $G$, is called the signed total domination number of $G$ and denoted by $\gamma _{\mathrm st}(G)$. A theorem stating lower bounds for $\gamma _{\mathrm st}(G)$ is stated for the case of regular graphs. The values of this number are found for complete graphs, circuits, complete bipartite graphs and graphs on $n$-side prisms. At the end it is proved that $\gamma _{\mathrm st}(G)$ is not bounded from below in general.
Classification : 05C35, 05C69
Keywords: signed total dominating function; signed total domination number; regular graph; circuit; complete graph; complete bipartite graph; Cartesian product of graphs 
@article{CMJ_2001_51_2_a0,
     author = {Zelinka, Bohdan},
     title = {Signed total domination number of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {225--229},
     year = {2001},
     volume = {51},
     number = {2},
     mrnumber = {1844306},
     zbl = {0977.05096},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2001_51_2_a0/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Signed total domination number of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 2001
SP  - 225
EP  - 229
VL  - 51
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/CMJ_2001_51_2_a0/
LA  - en
ID  - CMJ_2001_51_2_a0
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Signed total domination number of a graph
%J Czechoslovak Mathematical Journal
%D 2001
%P 225-229
%V 51
%N 2
%U http://geodesic.mathdoc.fr/item/CMJ_2001_51_2_a0/
%G en
%F CMJ_2001_51_2_a0
Zelinka, Bohdan. Signed total domination number of a graph. Czechoslovak Mathematical Journal, Tome 51 (2001) no. 2, pp. 225-229. http://geodesic.mathdoc.fr/item/CMJ_2001_51_2_a0/

[1] J. E.Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater: Signed domination in graphs. Graph Theory, Combinatorics and Application, Proceedings 7th Internat. Conf. Combinatorics, Graph Theory, Applications, vol. 1, Y. Alavi, A. J. Schwenk (eds.), John Willey & Sons, Inc., 1995, pp. 311–322. | MR

[2] T. W. Haynes, S. T. Hedetniemi and P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York-Basel-Hong Kong, 1998. | MR