Autor:	Isagani S. Cabahug, Jr., Marvanessa G. Dinorog
Rok vydání:	2022
Předmět:	General Medicine
Zdroj:	Asian Research Journal of Mathematics. :16-26
ISSN:	2456-477X
DOI:	10.9734/arjom/2022/v18i12621
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::536809fc482c3461c51a7c0f18b1feee https://doi.org/10.9734/arjom/2022/v18i12621 Zobrazit plný text záznamu