Signed total domination in graphs

Abstract A function f : V(G)→{−1,1} defined on the vertices of a graph G is a signed total dominating function (STDF) if the sum of its function values over any open neighborhood is at least one. A STDF f is minimal if there does not exist a STDF g : V(G)→{−1,1} , f≠g, for which g(v)⩽f(v) for every v∈V(G). The weight of a STDF is the sum of its function values over all vertices. The signed total domination number of G is the minimum weight of a STDF of G, while the upper signed total domination number of G is the maximum weight of a minimal STDF on G. In this paper we study these two parameters. In particular, we present lower bounds on the signed total domination number and upper bounds on the upper signed total domination number of a graph.

[1]  Yinzhen Li,et al.  A note on the lower bounds of signed domination number of a graph , 1999, Discret. Math..

[2]  Zoltán Füredi,et al.  Signed Domination in Regular Graphs and Set-Systems , 1999, J. Comb. Theory, Ser. B.

[3]  Odile Favaron,et al.  Signed domination in regular graphs , 1996, Discret. Math..

[4]  Stephen T. Hedetniemi,et al.  Total domination in graphs , 1980, Networks.

[5]  Michael A. Henning,et al.  Domination in regular graphs , 1996, Ars Comb..

[6]  Jirí Matousek.  On the Signed Domination in Graphs , 2000, Comb..

[7]  Ernest J. Cockayne,et al.  A characterisation of universal minimal total dominating functions in trees , 1995, Discret. Math..

[8]  Michael A. Henning,et al.  Inequalities relating domination parameters in cubic graphs , 1996, Discret. Math..

[9]  Bohdan Zelinka.  Some remarks on domination in cubic graphs , 1996, Discret. Math..

[10]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[11]  Michael A. Henning,et al.  Total domination in graphs with minimum degree three , 2000 .

[12]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[13]  Bohdan Zelinka,et al.  Signed Total Domination Nnumber of a Graph , 2001 .

[14]  E. Cockayne,et al.  Minimality and convexity of dominating and related functions in graphs: A unifying theory , 1997 .

[15]  Bo Yu.  Convexity of minimal total dominating functions in graphs , 1997 .

[16]  Alan Stacey.  Universal minimal total dominating functions of trees , 1995, Discret. Math..

[17]  Ernest J. Cockayne,et al.  Universal minimal total dominating functions in graphs , 1994, Networks.

[18]  Johannes H. Hattingh,et al.  The algorithmic complexity of signed domination in graphs , 1995, Australas. J Comb..

[19]  Ernest J. Cockayne,et al.  Total dominating functions in trees: Minimality and convexity , 1995, J. Graph Theory.

[20]  Michael A. Henning,et al.  Minus domination in graphs , 1999, Discret. Math..

[21]  Michael A. Henning.  Graphs with large total domination number , 2000 .