Rings Domination Number of Some Mycielski Graphs
Marvanessa G. Dinorog, Isagani S. Cabahug, Jr.
Asian Research Journal of Mathematics · pp. 16–26 · Published 3 Dec 2022
10.9734/arjom/2022/v18i12621Abstract
A set S of a graph G = (V (G);E(G)) is a rings dominating set if S is a dominating set and for every vertex in the complement of S has atleast two adjacent vertices. The caridinality of the minimum rings dominating set is the rings domination number of graph G, denoted by \(\gamma\)ri(G). In this paper we determine the exact rings domination number of the mycielski graphs of path graph, cycle graph, and crown graph including its parameter.
Cited by 3
Winelyn P. Pelias, Isagani S. Cabahug, · Asian Research Journal of Mathematics · 2023
Suha Wazzan, Hanan Ahmed · Symmetry · 2023
Department of Studies in Mathematics, Manasagangothri, University of Mysore, Mysuru (Karnataka), India., V. Thukarama, Soner N.D. · International Journal of Recent Technology and Engineering (IJRTE) · 2025
Related research
- Another Look of Rings Domination in Ladder Graph — shares topic coverage
- On Rings Domination of Total Graph of Some Graph Families — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
3
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.