p.126
p.131
p.136
p.141
p.145
p.148
p.152
p.156
p.160
Negative Signed Domination in Digraphs
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.
Info:
Periodical:
Pages:
145-147
Citation:
Online since:
June 2011
Authors:
Keywords:
Price:
Сopyright:
© 2011 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: