Minus Domination Numbers of Directed Graphs

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

334-337

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Bondy J A and Murty V.S. R, Graph Theory with Application. Amsterdam: Elsevier, (1976).

Google Scholar

[2] Jean Dunbar, Stephen Hedetniemi, Michael A. Henning and Alice A. McRae, Note: Minus domination in regular graphs, Discrete Math. 149(1996)311-312.

DOI: 10.1016/0012-365x(94)00329-h

Google Scholar

[3] Jean Dunbar, Stephen Hedetniemi, Michael A. Henning and Alice McRae, Minus domination in graphs, Discrete Math. 199(1999)35-47.

DOI: 10.1016/s0012-365x(98)00284-2

Google Scholar

[4] Bohdan Zelinka and Liberec, Signed domination numbers of directed graphs, Czechoslovak Mathematical Journal, 55(130)(2005)479-482.

DOI: 10.1007/s10587-005-0038-5

Google Scholar

[5] H. Karami, S.M. Sheikholeslami and Abdollah Khodkar, Lower bounds on the signed domination numbers of directed graphs, Discrete Math. 309(2009)2567-2570.

DOI: 10.1016/j.disc.2008.04.001

Google Scholar

[6] S.M. Sheikholeslami and L. Volkmann, Signed total k-domination numbers of directed graphs, An. St. Univ. Ovidius Constanta. 18(2)(2010)241-252.

Google Scholar