2-Distance and 3-Distance Domination Numbers of the Sierpinski Star Graph

Khilwa Annida, Siti Khabibah, Robertus Heri Soelistyo Utomo and Lucia Ratnasari

Journal of Mathematics Research, 2024, vol. 16, issue 3, 49

Abstract: The domination set D(G) in graph G=(V(G),E(G)) is a subset of the vertex set in graph G such that every vertex in V(G)\D(G) is adjacent to at least one vertex in D(G). The minimum cardinality of a domination set in graph G is called the domination number and is denoted as γ(G). The set S_k (G) is called the k-distance domination set in graph G if every vertex v in V(G)\S_k (G) has a distance of less than or equal to k from at least one vertex in S_k (G). The minimum cardinality of a k-distance domination set in graph G is called the k-distance domination number and is denoted as γ_k (G). This paper investigated the 2-distance and 3-distance domination sets in the Sierpinski Star graph SS_n and derived the number of 2-distance domination of γ_2 (SS_n)=1 for n<3 and γ_2 (SS_n)=3.3^(n-3) for n≥3, as well as the 3-distance domination number of γ_3 (SS_n)=1 for n<3 and γ_3 (SS_n)=3^(n-3) for n≥3.

Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/jmr/article/download/0/0/50377/54546 (application/pdf)
https://ccsenet.org/journal/index.php/jmr/article/view/0/50377 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:16:y:2024:i:3:p:49

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().