On domination in signed graphs-Reference-Cited by-同舟云学术

On domination in signed graphs

Published:2023-08-01 Issue:1 Volume:15 Page:1-9
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Joseph James¹,Joseph Mayamma²^ORCID

Affiliation:

1. 1 CHRIST(Deemed to be University) , Bangalore , Karnataka , India

2. 2 CHRIST(Deemed to be University) , Bangalore , Karnataka , India

Abstract

Abstract In this article the concept of domination in signed graphs is examined from an alternate perspective and a new definition of the same is introduced. A vertex subset D of a signed graph S is a dominating set, if for each vertex v not in D there exists a vertex u ∈ D such that the sign of the edge uv is positive. The domination number γ (S) of S is the minimum cardinality among all the dominating sets of S. We obtain certain bounds of γ (S) and present a necessary and su cient condition for a dominating set to be a minimal dominating set. Further, we characterise the signed graphs having small and large values for domination number.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2023-0001

Reference19 articles.

1. B. D. Acharya, Minus domination in signed graphs, J. comb. inf. syst. sci., 37 (2009), 333–358. ⇒2

2. B. D. Acharya, Domination and absorbance in signed graphs and digraphs, J. Comb. Math. Comb. Comput., 84 (2013), 5–20. ⇒2

3. X. Baogen, E.J. Cockayne, T. W. Haynes and S. T. Hedetniemi and Z. Shangchao, Extremal graphs for inequalities involving domination parameters, Discrete Math., 216 (2000), 1–10. ⇒6

4. C. Berge, The Theory of Graphs and Its Applications, Methuen, London, 1962. ⇒2

5. G. Chartrand, H. Gavlas, F. Harary and M. Schultz, On signed degrees in signed graphs, Czechoslov. Math. J., 44 (1994), 677–690. ⇒2