Let G = (V, E) be a graph, for any edge f?E(G) the degree of f=uv in G is defined by deg(f)=deg(u)+deg(v) ?2. A set F?E for edges is an equitable edge dominating set of G if every edge f not in F is adjacent to at least one edge such that . The minimum cardinality of such equitable edge dominating set is denoted by and is called equitable edge domination number of G. In this paper we introduced The connected equitable edge domination and neighbourhood connected equitable edge domination in a graphs exact value for the some standard graphs bounds and some interesting results are obtained.
展开▼
