Domination Defect in the Edge Corona of Graphs

Given a graph G = (V (G),E(G)), a nonempty set S V (G) of fixed cardinality \(\gamma\)(G) - k is called a k - set of G, where 1 k (G) -1, if S gives the minimum cardinality |V (G) \ NG[S]| for all the possible subsets of V (G), each of which has (G) - k elements. This is the number of vertices in G which are left undominated by S. In this paper, the k-domination defects of graphs resulting from the binary operation edge corona GH are characterized and as a direct consequence, the corresponding k-domination defect k(GH) is then determined.