Domination Defect in the Edge Corona of Graphs
Aldwin T. Miranda, Rolito G. Eballe
Asian Research Journal of Mathematics · pp. 95–101 · Published 19 Dec 2022
10.9734/arjom/2022/v18i12628Abstract
Given a graph G = (V (G),E(G)), a nonempty set S \(\subseteq\) V (G) of fixed cardinality \(\gamma\)(G) - k is called a \(\zeta\)k - set of G, where 1 \(\le\) k \(\le\) \(\gamma\)(G) -1, if S gives the minimum cardinality |V (G) \ NG[S]| for all the possible subsets of V (G), each of which has \(\gamma\)(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\(\diamond\)H are characterized and as a direct consequence, the corresponding k-domination defect \(\zeta\)k(G\(\diamond\)H) is then determined.
Cited by 5
A. Cabrera-Martínez, J. L. López-Carmona, Ismael Rios-Villamar · Bulletin of the Iranian Mathematical Society · 2026
A. Cabrera-Martínez, J. L. López-Carmona, Ismael Rios-Villamar · Quaestiones Mathematicae. Journal of the South African Mathematical Society · 2026
Madhura Dutta, Anil Maheshwari, S. Nandy · arXiv.org · 2025
Sergio Canoy, Jesica Anoche · European Journal of Pure and Applied Mathematics · 2025
Jesica Anoche, Sergio Canoy · European Journal of Pure and Applied Mathematics · 2025
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
5
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.