Name
Abstract | ||
|---|---|---|
For a graph G, let γr2(G) and γR(G) denote the 2-rainbow domination number and the Roman domination number, respectively. Fujita and Furuya (2013) proved γr2(G)+γR(G)≤64n(G) for a connected graph G of order n(G) at least 3. Furthermore, they conjectured γr2(G)+γR(G)≤43n(G) for a connected graph G of minimum degree at least 2 that is distinct from C5. We characterize all extremal graphs for their inequality and prove their conjecture. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2016.01.021 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Rainbow domination,Roman domination | Journal | 205 |
Issue | ISSN | Citations |
C | 0166-218X | 1 |
PageRank | References | Authors |
0.36 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| José D. Alvarado | 1 | 7 | 3.82 |
| Simone Dantas | 2 | 119 | 24.99 |
| Dieter Rautenbach | 3 | 946 | 138.87 |