On the Edge Covering Transversal Edge Domination in Graphs

Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every minimum edge covering set in a graph Gis called an edge covering transversal edge dominating set of G. The minimum cardinality of an edge covering transversal edge dominating set is called an edge covering transversal edge domination number of Gand is denoted by \gamma_{eect}(G). Any edge covering transversal edge dominating set of cardinalities\gamma_{eect}(G) is called a \gamma_{eect}-set of G. The edge covering transversal edge domination number of some standard graphs are determined. Some properties satisfied by this concept are studied