Name
Title | ||
|---|---|---|
Trees with equal Roman {2}-domination number and independent Roman {2}-domination number |
Abstract | ||
|---|---|---|
A Roman {2}-dominating function (R{2}DF) on a graph G = (V, E) is a function f : V -> {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f (v) = 2 or two vertices v(1), v(2) with f (v(1)) = f (v(2)) = 1. The weight of an R{2}DF f is the value w(f) = E(u is an element of V)f(u). The minimum weight of an R{2}DF on a graph G is called the Roman {2}-domination number gamma({R2}) (G) of G. An R{2}DF f is called an independent Roman {2}-dominating function (IR{2}DF) if the set of vertices with positive weight under f is independent. The minimum weight of an IR{2}DF on a graph G is called the independent Roman {2}-domination number if i({R2}) (G) of G. In this paper, we answer two questions posed by Rahmouni and Chellali. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1051/ro/2018116 | RAIRO-OPERATIONS RESEARCH |
Keywords | Field | DocType |
Roman {2}-domination,independent Roman {2}-domination,tree,algorithm | Graph,Combinatorics,Vertex (geometry),Minimum weight,Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
53 | 2 | 0399-0559 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pu Wu | 1 | 2 | 2.79 |
| Zepeng Li | 2 | 20 | 9.07 |
| Zehui Shao | 3 | 119 | 30.98 |
| Seyed Mahmoud Sheikholeslami | 4 | 54 | 28.15 |