Neighborhood connected edge domination in graphs
Keyword(s):
Let G = (V,E) be a connected graph. An edge dominating set X of G is called a neighborhood connected edge dominating set (nced-set) if the edge induced subgraph < N(X) > is connected. The minimum cardinality of a nced-set of G is called the neighborhood connected edge domination number of G and is denoted by. In this paper we initiate a study of this parameter.
2012 ◽
Vol 43
(4)
◽
pp. 557-562
◽
Keyword(s):
2020 ◽
Vol 8
(4S5)
◽
pp. 66-68
Keyword(s):
Keyword(s):
2011 ◽
Vol 3
(3)
◽
pp. 547-555
◽
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050065
Keyword(s):