Results on Accurate Edge Domination Number in Graphs
VENKATESH S.H., V. R. Kulli, Venkanagouda M Goudar, VENKATESHA VENKATESHA · Journal of Ultra Scientist of Physical Sciences Section A · 2017
A edge dominating set F of a graph G = (V , E) is an accurate edge dominating set, if has no edge dominating set of cardinality | F | . The accurate edge domination number (G) ae is the minimum cardinality of an accurate edge dominating set. We study the graph theoretic properties of (G) ae and its exact values for some standard graphs. The relation between (G) ae with other parameters are also investigated