Rings Domination Number of Some Mycielski Graphs

Dinorog, Marvanessa G. and Jr., Isagani S. Cabahug, (2022) Rings Domination Number of Some Mycielski Graphs. Asian Research Journal of Mathematics, 18 (12). pp. 16-26. ISSN 2456-477X

[thumbnail of 621-Article Text-1087-1-10-20221203.pdf] Text
621-Article Text-1087-1-10-20221203.pdf - Published Version
Download (829kB)

Abstract

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 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.

Item Type: Article
Subjects: EP Archives > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 05 Dec 2022 08:11
Last Modified: 23 Dec 2023 05:39
URI: http://research.send4journal.com/id/eprint/602

Actions (login required)

View Item
View Item