the arrow edge domination in graphs

The idea of this paper is to study the arrow edge domination. the arrow edge dominating set de of a graph g is an arrow edge dominating set if every edge from d dominates exactly one edge from v − d and is adjacent to two or more edges from d. the arrow edge domination number γare (g) is the minimum cardinality of all arrow edge dominating sets in g. several properties and bounds are introduced here. our results are applied in some graphs such that the path graph, cycle graph, complete graph, wheel graph, complete bipartite graph, barbell graph, helm graph, big helm graph, complement path graph, complement cycle graph, the complement of complete graph and complement of complete bipartite graph. an important fact given here is if g has no arrow vertex dominating set, then g may have an arrow edge dominating set and an example is given.