Negative Signed Domination in Digraphs

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

145-147

Citation:

Online since:

June 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in graphs -Advanced Topics, Marcel Dekker, Inc., New York, (1998).

Google Scholar

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

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] D.B. West, Introduction to Graph Theory, Prentice-Hall, Inc, (2000).

Google Scholar

[5] 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

[6] 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