Name
Abstract | ||
|---|---|---|
Let γr2(G) be the 2-rainbow domination number of a graph G. In our work, we solve an open question for 2-rainbow domination number of general Petersen graphs P(n,k). In addition, we proved that γr2(P(n,k))=n for n≤12, γr2(P(n,1))=n for n≥5, and γr2(P(2k+2,k))=2k+2 for k≥2. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2018.10.027 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Rainbow domination,Generalized Petersen graph,Petersen graph,Graph domination | Graph,Discrete mathematics,Combinatorics,Generalized Petersen graph,Domination analysis,Rainbow,Mathematics | Journal |
Volume | ISSN | Citations |
257 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 10 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zehui Shao | 1 | 119 | 30.98 |
| huiqin jiang | 2 | 3 | 3.83 |
| Pu Wu | 3 | 8 | 2.22 |
| Shao-hui Wang | 4 | 126 | 19.62 |
| Janez Žerovnik | 5 | 223 | 25.71 |
| Xiaosong Zhang | 6 | 91 | 14.00 |
| Jia-Bao Liu | 7 | 110 | 21.86 |