Name
Abstract | ||
|---|---|---|
Abstract A signed Roman k -dominating function on a graph G = ( V ( G ) , E ( G ) ) is a function f : V ( G ) → { − 1 , 1 , 2 } such that (i) every vertex u with f ( u ) = − 1 is adjacent to at least one vertex v with f ( v ) = 2 and (ii) ∑ x ∈ N [ w ] f ( x ) ≥ k holds for any vertex w . The weight of f is ∑ u ∈ V ( G ) f ( u ) , the minimum weight of a signed Roman k -dominating function is the signed Roman k -domination number γ s R k ( G ) of G . It is proved that determining the signed Roman k -domination number of a graph is NP-complete for k ∈ { 1 , 2 } . Using a discharging method, the values γ s R 2 ( C 3 □ C n ) and γ s R 2 ( C 4 □ C n ) are determined for all n . |
Year | Venue | Field |
|---|---|---|
2017 | Discrete Applied Mathematics | Discharging method,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Torus,Minimum weight,Domination analysis,Mathematics |
DocType | Volume | Citations |
Journal | 233 | 2 |
PageRank | References | Authors |
0.52 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zehui Shao | 1 | 119 | 30.98 |
| S. Klavžar | 2 | 41 | 4.94 |
| Zepeng Li | 3 | 3 | 1.22 |
| Pu Wu | 4 | 8 | 2.22 |
| Jin Xu | 5 | 230 | 45.13 |