Results on Accurate Edge Domination Number in Graphs
1Research Scholar, Sri Gauthama Research Centre, (Affiliated to Kuvempu University), Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India
2 Department of Mathematics, Gulbarga University, Gulbarga, India
3 Department of Mathematics, Sri Gauthama Research Centre, (Affiliated to Kuvempu University), Sri Siddhartha Institute of Technology, Tumkur, karnataka, India
4 Department of Mathematics, Kuvempu University Shankarghatta, Shimoga, Karnataka, India.
Email address of Corresponding Author: sh1.venkatesh@gmail.com
A edge dominating set F of a graph G = (V , E) is an accurate edge dominating set, if < E F > 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
Copy the following to cite this article:
VENKATESH S.H1 , V.R. KULLI 2 , VENKANAGOUDA M. GOUDAR 3 and VENKATESHA 4, "Results on Accurate Edge Domination Number in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 1, Page Number 21-29, 2017Copy the following to cite this URL:
VENKATESH S.H1 , V.R. KULLI 2 , VENKANAGOUDA M. GOUDAR 3 and VENKATESHA 4, "Results on Accurate Edge Domination Number in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 1, Page Number 21-29, 2017Available from: https://www.ultrascientist.org/paper/754/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
