Geodesic
Minus total domination in graphs
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 4, pp. 861-870 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

A three-valued function $f\: V\rightarrow \{-1,0,1\}$ defined on the vertices of a graph $G=(V,E)$ is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every $v\in V$, $f(N(v))\ge 1$, where $N(v)$ consists of every vertex adjacent to $v$. The weight of an MTDF is $f(V)=\sum f(v)$, over all vertices $v\in V$. The minus total domination number of a graph $G$, denoted $\gamma _t^{-}(G)$, equals the minimum weight of an MTDF of $G$. In this paper, we discuss some properties of minus total domination on a graph $G$ and obtain a few lower bounds for $\gamma _t^{-}(G)$.
A three-valued function $f\: V\rightarrow \{-1,0,1\}$ defined on the vertices of a graph $G=(V,E)$ is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every $v\in V$, $f(N(v))\ge 1$, where $N(v)$ consists of every vertex adjacent to $v$. The weight of an MTDF is $f(V)=\sum f(v)$, over all vertices $v\in V$. The minus total domination number of a graph $G$, denoted $\gamma _t^{-}(G)$, equals the minimum weight of an MTDF of $G$. In this paper, we discuss some properties of minus total domination on a graph $G$ and obtain a few lower bounds for $\gamma _t^{-}(G)$.
Classification : 05C69
Keywords: minus domination; total domination; minus total domination 
@article{CMJ_2009_59_4_a0,
     author = {Xing, Hua-Ming and Liu, Hai-Long},
     title = {Minus total domination in graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {861--870},
     year = {2009},
     volume = {59},
     number = {4},
     mrnumber = {2563563},
     zbl = {1224.05387},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2009_59_4_a0/}
}
TY  - JOUR
AU  - Xing, Hua-Ming
AU  - Liu, Hai-Long
TI  - Minus total domination in graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2009
SP  - 861
EP  - 870
VL  - 59
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/CMJ_2009_59_4_a0/
LA  - en
ID  - CMJ_2009_59_4_a0
ER  - 
%0 Journal Article
%A Xing, Hua-Ming
%A Liu, Hai-Long
%T Minus total domination in graphs
%J Czechoslovak Mathematical Journal
%D 2009
%P 861-870
%V 59
%N 4
%U http://geodesic.mathdoc.fr/item/CMJ_2009_59_4_a0/
%G en
%F CMJ_2009_59_4_a0
Xing, Hua-Ming; Liu, Hai-Long. Minus total domination in graphs. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 4, pp. 861-870. http://geodesic.mathdoc.fr/item/CMJ_2009_59_4_a0/

[1] Allan, R. B., Laskar, R. C., Hedetniemi, S. T.: A note on total domination. Discrete Math. 49 (1984), 7-13. | DOI | MR | Zbl

[2] Archdeacon, D., Ellis-Monaghan, J., Fisher, D., al., et: Some remarks on domination. Journal of Graph Theory 46 (2004), 207-210. | DOI | MR | Zbl

[3] Arumugam, S., Thuraiswamy, A.: Total domination in graphs. Ars Combin. 43 (1996), 89-92. | MR | Zbl

[4] Cockayne, E. J., Dawes, R. M., Hedetniemi, S. T.: Total domination in graphs. Networks 10 (1980), 211-219. | DOI | MR | Zbl

[5] Dunbar, J. E., Goddard, W., Hedetniemi, S. T., Henning, M. A., McRae, A. A.: The algorithmic complexity of minus domination in graphs. Discrete Appl. Math. 68 (1996), 73-84. | DOI | MR | Zbl

[6] Dunbar, J. E., Hedetniemi, S. T., Henning, M. A., McRae, A. A.: Minus domination in regular graphs. Discrete Math. 149 (1996), 311-312. | DOI | MR | Zbl

[7] Dunbar, J. E., Hedetniemi, S. T., Henning, M. A., McRae, A. A.: Minus domination in graphs. Discrete Math. 199 (1999), 35-47. | MR | Zbl

[8] Favaron, O., Henning, M. A., Mynhart, C. M., al., et: Total domination in graphs with minimum degree three. Journal of Graph Theory 32 (1999), 303-310.

[9] Harris, L., Hattingh, J. H.: The algorithmic complexity of certain functional variations of total domination in graphs. Australas. Journal of Combin. 29 (2004), 143-156. | MR | Zbl

[10] Haynes, T. W., Hedetniemi, S. T., Slater, P. J.: Fundamentals of domination in graphs. New York, Marcel Dekker (1998). | MR | Zbl

[11] Henning, M. A.: Graphs with large total domination number. Journal of Graph Theory 35 (2000), 21-45. | DOI | MR | Zbl

[12] Henning, M. A.: Signed total domination in graphs. Discrete Math. 278 (2004), 109-125. | DOI | MR | Zbl

[13] Kang, L. Y., Kim, H. K., Sohn, M. Y.: Minus domination number in $k$-partite graphs. Discrete Math. 227 (2004), 295-300. | DOI | MR | Zbl

[14] Xing, H. M., Sun, L., Chen, X. G.: On signed total domination in graphs. Journal of Beijing Institute of Technology 12 (2003), 319-321. | MR

[15] Xing, H. M., Sun, L., Chen, X. G.: On a generalization of signed total dominating functions of graphs. Ars Combin. 77 (2005), 205-215. | MR | Zbl

[16] Zelinka, B.: Signed total domination number of a graph. Czech. Math. J. 51 (2001), 225-229. | DOI | MR | Zbl