Name
Abstract | ||
|---|---|---|
A subset S of the vertex set of a graph G is a dominating set if every vertex of G not in S has at least one neighbor in S. The domination number γ(G) is defined to be the minimum cardinality among all dominating set of G. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ipl.2018.01.004 | Information Processing Letters |
Keywords | Field | DocType |
Double Roman domination number,Roman domination,Domination number,Tree,Combinatorial problems | Discrete mathematics,Graph,Dominating set,Combinatorics,Vertex (geometry),Cardinality,Minimum weight,Polynomial algorithm,Domination analysis,Time complexity,Mathematics | Journal |
Volume | ISSN | Citations |
134 | 0020-0190 | 3 |
PageRank | References | Authors |
0.45 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiujun Zhang | 1 | 159 | 18.75 |
| Zepeng Li | 2 | 20 | 9.07 |
| huiqin jiang | 3 | 3 | 3.83 |
| Zehui Shao | 4 | 119 | 30.98 |