Abstract
The concept of minus domination number of an undirected graph is transferred to directed graphs. Exact values are found for the directed cycle and particular types of tournaments. Furthermore, we present some lower bounds for minus domination number in terms of the order, the maximum degree, the maximum outdegree and the minimum outdegree of a directed graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
