Accurate Connected Edge Domination Number in Graphs
Venkanagouda M Goudar, VENKATESH S.H., VENKATESHA VENKATESHA, TEJASWINI K.M. · Journal of Ultra Scientist of Physical Sciences Section A · 2017
An accurate edge dominating set D of a graph G = (V,E) is an accurate connected edge dominating set, if is connected. The accurate connected edge domination number (G) cae is the minimum cardinality of an accurate connected edge dominating set. In this paper, we initiate a study of (G) cae in terms of vertices, edges, cut vertices and different parameters of G . Further we characterize the accurate connected edge domination number in cartesian product and corona of graphs.