Restrained 2-Domination in Graphs
Citations
7 citations
Cites methods from "Restrained 2-Domination in Graphs"
...From [5], γr2(Pm)× γr2(Pn) = m× n and hence γr2(Pm × Pn) ≤ γr2(Pm)× γr2(Pn) for m,n ≥ 3....
[...]
...We have the following characterization of those graphs for which the 2-restrained domination number is equal to the 2-domination number [5]....
[...]
...The restrained 2-domination number of G denoted by γr2(G) is the minimum cardinality of a restrained 2-dominating set of G. Email address: j.jaganmohan@hotmail.com (J. Jagan Mohan) 352...
[...]
...The concept of restrained 2- domination was introduced by Kelkar and Mohan [5]....
[...]
4 citations
Cites background from "Restrained 2-Domination in Graphs"
...The concepts of restrained domination, 2-domination and restrained 2domination in graphs were studied in [1, 6], [3, 4] and [2, 5], respectively....
[...]
2 citations
Cites background from "Restrained 2-Domination in Graphs"
...Kelkar and Mohan in [4] introduced the concept of 2-domination and derived some characterization when the restrained domination number becomes equally the restrained 2-domination number....
[...]
References
1,289 citations
340 citations
"Restrained 2-Domination in Graphs" refers background in this paper
...A vertex in a graph G dominates itself and its neighbors....
[...]
212 citations
"Restrained 2-Domination in Graphs" refers background in this paper
...Cyman and Raczek [6] introduced the concept of total restrained domination....
[...]
140 citations