Paper Title:
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
Edited by
Zhenyu Du and Bin Liu
Pages
145-147
DOI
10.4028/www.scientific.net/AMM.65.145
Citation
W. S. Li, "Negative Signed Domination in Digraphs", Applied Mechanics and Materials, Vol. 65, pp. 145-147, 2011
Online since
June 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Wen Sheng Li, Hua Ming Xing
Abstract:The concept of minus domination number of an undirected graph is transferred to directed graphs. Exact values are found for the directed...
334
Authors: Mei Jin Luo
Chapter 16: Algorithms and Analysis
Abstract:There is a one-to-one relationship between nonnegative matrix pairs and two-colored digraph, so the problem of matrices can be changed into...
1296
Authors: Mei Jin Luo
Chapter 14: Computer Applications and Mathematical Modeling, Numerical Methods, Intelligent Algorithms and Optimization
Abstract:There is a one-to-one relationship between nonnegative matrix pairs and two-colored digraph. With the knowledge of graph theory, by studying...
1100