Negative Signed Domination in Digraphs

摘要

The concept of negative signed domination number of a directed graph is introduced. Exact values are found for the directed cycle and particular types of tournaments. Furthermore, it is proved that the negative signed domination number may be arbitrarily big for digraphs with a directed Hamiltonian cycle.