Advances and Applications in Discrete Mathematics
Volume 21, Issue 2, Pages 183 - 192
(July 2019) http://dx.doi.org/10.17654/DM021020183 |
|
RESTRAINED EDGE DOMINATION IN GRAPHS
Mohammad Nur S. Paspasan
|
Abstract: Let G = (V(G), E(G)) be a simple connected graph. A subset M of E(G) is a restrained edge dominating set of G if every edge not in M is adjacent to some edge in M and to another edge not in M. The restrained edge domination number of G, denoted by γre(G), is the minimum cardinality of a restrained edge dominating set of G. Moreover, any restrained edge dominating set of G with cardinality γre(G) is referred to as a γre-set of G. In this study, the researcher investigates the concept of restrained edge domination in a graph and obtains some results involving the concepts of edge domination and restrained edge domination. |
Keywords and phrases: domination, edge domination, restrained edge domination.
|
|
Number of Downloads: 287 | Number of Views: 1781 |
|