Double domination in signed graphs
A graph with either positive or negative labels on the edge becomes a signed graph. Given a signed graph $ \Sigma =(V,E,\sigma ) $, a subset D of V is said to be a double dominating set for $ \Sigma $, if it satisfies the following conditions: (i) every vertex u of $ \Sigma $ is either in D and u ha...
Main Authors: | P.K. Ashraf, K.A. Germina |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2016-12-01
|
Series: | Cogent Mathematics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311835.2016.1186135 |
Similar Items
-
Bounds on signed total double Roman domination
by: L. Shahbazi, et al.
Published: (2020-12-01) -
On the signed Italian domination of graphs
by: Ashraf Karamzadeh, et al.
Published: (2019-09-01) -
On the domination and signed domination numbers of zero-divisor graph
by: Ebrahim Vatandoost, et al.
Published: (2016-10-01) -
Weak signed Roman domination in graphs
by: Lutz Volkmann
Published: (2020-12-01) -
The common minimal dominating signed graph
by: P. Siva Reddy, et al.
Published: (2012-09-01)