Displaying similar documents to “Nearly acyclic digraphs”

Signed domination numbers of directed graphs

Bohdan Zelinka (2005)

Czechoslovak Mathematical Journal

Similarity:

The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments. It is proved that for digraphs with a directed Hamiltonian cycle the signed domination number may be arbitrarily small.