Asian Research Journal of Mathematics Volume 18, Issue 12, Page 95-101, 2022; Article no.ARJOM.94745 ISSN: 2456-477X Domination Defect in the Edge Corona of Graphs Aldwin T. Miranda a and Rolito G. Eballe b a Institute of Teacher Education and Information Technology, Southern Philippines Agri-business and Marine and Aquatic School of Technology, Malita, Davao Occidental-8012, Philippines. b Mathematics Department, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon-8714, Philippines. Authors’ contributions This work was carried out in collaboration between both authors. Both authors read and approved the final manuscript. Article Information DOI: 10.9734/ARJOM/2022/v18i12628 Open Peer Review History: This journal follows the Advanced Open Peer Review policy. Identity of the Reviewers, Editor(s) and additional Reviewers, peer review comments, different versions of the manuscript, comments of the editors, etc are available here: https://www.sdiarticle5.com/review-history/94745 Received: 05/10/2022 Accepted: 10/12/2022 Original Research Article Published: 19/12/2022 Abstract Given a graph G =(V (G),E(G)), a nonempty set S ⊆ V (G) of fixed cardinality γ(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 G ⋄ H are characterized and as a direct consequence, the corresponding k-domination defect ζ k (G⋄H) is then determined. Keywords: k-domination defect; minimum dominating set; edge corona. 2020 Mathematics Subject Classification: 05C69, 05C70, 05C75. *Corresponding author: E-mail: amiranda@spamast.edu.ph; Asian Res. J. Math., vol. 18, no. 12, pp. 95-101, 2022