Highly Influenced

# The algorithmic complexity of signed domination in graphs

@article{Hattingh1995TheAC, 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}, year={1995}, volume={12}, pages={101-112} }

- Published 1995 in 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.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-9 of 9 references

Highly Influential

Highly Influential