Name
Abstract | ||
|---|---|---|
Let k >= 1 be an integer and G be a simple and finite graph with vertex set V (G). A signed total Roman k-dominating function (STRkDF) on a graph G is a function f : V (G) -> {- 1, 1, 2} such that (i) every vertex v with f(v) = -1 is adjacent to at least one vertex u with f(u) = 2 and (ii) Sigma(u is an element of N(v)) f(u) >= k holds for any vertex v. The weight of an STRkDF f is Sigma(u is an element of V) ((G)) f (u) and the minimum weight of an STRkDF is the signed total Roman k-domination number gamma(k)(stR) (G) of G. In this paper, we establish some sharp bounds on the signed total Roman 2-domination number. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1142/S1793830920500135 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | DocType | Volume |
Signed total Roman k-dominating function, signed total Roman k-domination number | Journal | 12 |
Issue | ISSN | Citations |
1 | 1793-8309 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Khoeilar | 1 | 12 | 6.57 |
| L. Shahbazi | 2 | 0 | 1.01 |
| Seyed Mahmoud Sheikholeslami | 3 | 54 | 28.15 |
| Zehui Shao | 4 | 119 | 30.98 |