The algorithmic complexity of signed domination in graphs

  title={The algorithmic complexity of signed domination in graphs},
  author={Johannes H. Hattingh and Michael A. Henning and Peter J. Slater},
  journal={Australasian J. Combinatorics},
A two-valued function f defined on the vertices of a graph G (V, E), I : V -+ {-I, I}, is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v]) 2: 1, where N(v] consists of v and every vertex adjacent to v. The of a signed dominating function is ICV) = L f( v), over all vertices v E V. The signed domination number of graph G, denoted /s(G), equals the minimum weight of a signed dominating function of G. The… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Dominating sets in chordal versity of Waterloo, 1980

  • K. S. Booth
  • Research CS-80-34,
  • 1980
Highly Influential
5 Excerpts

Graphs and Digraphs, Second Edition, Wadsworth and Brooks/Cole

  • G. Chartrand, L. Lesniak
  • 1986
2 Excerpts

Contributions to the theory of domination , independence and irredundance in Discrete Math

  • A. K. Dewdney, S. T. Hedetniemi, M. A. Henning, P. J. Slater
  • 1981

Contributions to the theory of domination, independence and irredundance

  • E. J. Cockayne, C. O. Favaron, A. Thomason
  • Discrete Math. 33(1981),
  • 1981
2 Excerpts

Signed domination in graphs , to appear in the Proceedings in the Seventh International Conference in Gra , lh Theory , Combinatorics , Algorithms , and Applications

  • D. S. Johnson
  • Computers and Intractability : A Guide to the…
  • 1979

Similar Papers

Loading similar papers…