Lower bounds on the signed domination numbers of directed graphs

A numerical invariant of directed graphs concerning domination which is named signed domination number @c"S is studied in this paper. We present some sharp lower bounds for @c"S in terms of the order, the maximum degree and the chromatic number of a directed graph.