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: | , |
|---|---|
| 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 |