Name
Abstract | ||
|---|---|---|
For a graph G, a function h from V (G) to 2^{1,2} is a 2-rainbow-DF of G if for any vertex v with h(v) = ϕ we have U_uεN(v)^h(u) = {1, 2}, where N(v) is the set of neighbors of v. A 2-rainbow-DF is said to be a 2-rainbow restrained-DF (2RRDF) if the induced subgraph of G by the vertices with label ϕ contains no isolated vertex. The weight of a 2RRDF h is defined to be ΣvεV(G)^|h(v)|. The minimum weight of a 2RRDF of G is said to be the 2-rainbow restrained domination number (2RRDN) γrr(G) of G. In this paper we show the complexity result of the 2RRDF problem for planar graphs. Moreover, we determine the 2RRDN of some 2D torus networks. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/CyberC.2018.00077 | 2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) |
Keywords | Field | DocType |
Complexity theory,Two dimensional displays,Graph theory,Informatics,Upper bound,Distributed computing | Graph theory,Combinatorics,Vertex (geometry),Upper and lower bounds,Computer science,Computer network,Induced subgraph,Torus,Minimum weight,Domination analysis,Planar graph | Conference |
ISSN | ISBN | Citations |
2475-7020 | 978-1-7281-0974-9 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongsheng Rao | 1 | 3 | 2.23 |
| Pu Wu | 2 | 2 | 2.79 |
| Zehui Shao | 3 | 119 | 30.98 |
| Ramy Shaheen | 4 | 0 | 0.34 |
| S.M. Sheikholeslami | 5 | 71 | 14.63 |
| Lanxiang Chen | 6 | 12 | 4.66 |