A signed graph Σ = (G, σ) is a graph with a sign attached to each arc. A subset S of V (Σ) is called a dominating set of Σ if |N+ (v) ∩ S| > |N- (v) ∩ S| for all v ∈ V - S . A dominating set S ⊆ V is a connected dominating set of Σ if <S> is connected. The minimum cardinality of a connected dominating set of Σ denoted by γsc, is called the connected domination number of Σ . In this paper, we introduce the connected domination number in a signed graph Σ and study different bounds and characterization of the connected domination number in a signed graph Σ . Furthermore, we find the best possible upper and lower bounds for where Σ is connected.
AcharyaB.D., Domination and absorbence in signed graph and digraph: I. Foundations, The Journal of Combinatorial Mathematics and Combinatorial Computing84(2013), 1–10.
2.
AshrafP.K. and GerminaK.A., On minimal dominating sets for signed graphs, Advances and Applications in Discrete Mathematics15 (2015), 101–112.
3.
ChartrandG. and LesniakL., Graphs and Digraphs, Chapman and Hall, CRC, 4th edition, (2005).
4.
HararyF., On the notion of balance of a signed graph, Michigan Math J2 (1953), 143–146.
