Geodesic
Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 641-650.

Voir la notice de l'article provenant de la source Library of Science

Let G be a graph with vertex set V (G), and let f : V (G) →−1, 1 be a two-valued function. If k ≥ 1 is an integer and ∑_ x ∈ N(v) f(x) ≥ k for each v ∈ V (G), where N(v) is the neighborhood of v, then f is a signed total k-dominating function on G. A set f_1, f_2, . . ., f_d of distinct signed total k-dominating functions on G with the property that ∑_i=1^d f_i(x) ≤ k for each x ∈ V (G), is called a signed total (k, k)-dominating family (of functions) on G. The maximum number of functions in a signed total (k, k)-dominating family on G is the signed total (k, k)-domatic number of G. In this article we mainly present upper bounds on the signed total (k, k)- domatic number, in particular for regular graphs.
Keywords: signed total (k, k)-domatic number, signed total k-dominating function, signed total k-domination number, regular graphs 
@article{DMGT_2015_35_4_a3,
     author = {Volkmann, Lutz},
     title = {Upper {Bounds} on the {Signed} {Total} (k, {k)-Domatic} {Number} of {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {641--650},
     publisher = {mathdoc},
     volume = {35},
     number = {4},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a3/}
}
TY  - JOUR
AU  - Volkmann, Lutz
TI  - Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2015
SP  - 641
EP  - 650
VL  - 35
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a3/
LA  - en
ID  - DMGT_2015_35_4_a3
ER  - 
%0 Journal Article
%A Volkmann, Lutz
%T Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2015
%P 641-650
%V 35
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a3/
%G en
%F DMGT_2015_35_4_a3
Volkmann, Lutz. Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 641-650. http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a3/

[1] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, 1998).

[2] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Ed(s), Domination in Graphs, Advanced Topics (Marcel Dekker, Inc., New York, 1998).

[3] M.A. Henning, Signed total domination in graphs, Discrete Math. 278 (2004) 109-125. doi:10.1016/j.disc.2003.06.002

[4] M.A. Henning, On the signed total domatic number of a graph, Ars Combin. 79 (2006) 277-288.

[5] S.M. Sheikholeslami and L. Volkmann, Signed total (k, k)-domatic number of a graph, AKCE Int. H. J. Graphs Comb. 7 (2010) 189-199.

[6] C. Wang, The signed k-domination numbers in graphs, Ars Combin. 106 (2012) 205-211.

[7] B. Zelinka, Signed total domination number of a graph, Czechoslovak. Math. J. 51 (2001) 225-229. doi:10.1023/A:1013782511179