Accurate Connected Edge Domination Number in Graphs

AUTHOR AND
AFFILIATION

VENKANAGOUDA M. GOUDAR
Department of Mathematics, Gouthama Research Centre, (Affiliated to Kuvempu University), Sri Siddhartha Institute of Technology, Tumkur, karnataka, India
VENKATESH S.H (sh1.venkatesh@gmail.com)
Research Scholar, Gouthama Research Centre, (Affiliated to Kuvempu University), Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India
VENKATESHA
Department of Mathematics, Kuvempu University Shankarghatta, Shimoga, Karnataka, India
TEJASWINI K.M.
Department of Mathematics, Sri Siddhartha Institute of Technology, Tumkur, karnataka, India

KEYWORDS:

Edge dominating set, Accurate edge dominating set, Accurate connected edge dominating set, Mathematics Subject Classification: 05C, 5C05, 05C70

Issue Date:

July, 2017

Pages:

290-301

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.29 – No.7

PDF

Click Here Download PDF

DOI:

http://dx.doi.org/10.22147/jusps-A/290708

ABSTRACT:

An accurate edge dominating set D of a graph G = (V,E) is an accurate connected edge dominating set, if < D > 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.

Copy the following to cite this Article:

V. M. Goudar; V. S.h; Venkatesha; T. K.m., “Accurate Connected Edge Domination Number in Graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 7, Page Number 290-301, 2017


Copy the following to cite this URL:

V. M. Goudar; V. S.h; Venkatesha; T. K.m., “Accurate Connected Edge Domination Number in Graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 7, Page Number 290-301, 2017

Available from: http://www.ultrascientist.org/paper/825/accurate-connected-edge-domination-number-in-graphs


An accurate edge dominating set D of a graph G = (V,E) is an accurate connected edge dominating set, if < D > 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.