$[1, 2]$- AND $(1, 2)^\ast$-DOMINATING SETS IN SOME SPECIAL GRAPHS
Advances and Applications in Discrete Mathematics · 31.07.2026 · 43 (7) · 999-1014
DOI: 10.17654/0974165826060 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 31.07.2026. Verfasst von Ronel A. Baluntang und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let $G=(V, E)$ be a simple graph. Then a subset $S\subseteq V(G)$ is a $[1, 2]$-set if for each $v \in V\setminus S$, $1 \le |N(v) \cap S| \le 2$. A minimum cardinality $\gamma_{[1, 2]}(G)$ of a $[1, 2]$-set is called a $[1, 2]$-domination number of $G$. Also, $S$ is called a $(1, 2)^\ast$-dominating set of $G$ if $S$ is a dominating set and for every $v \in V\setminus S$, there exists $u \in S$ such that $d_G(u, v)=2$. A minimum cardinality $\gamma^\ast_{(1, 2)}(G)$ of such a set is called a $(1, 2)^\ast$-domination number of $G$. In this paper, we characterize the $[1, 2]$-dominating sets and $(1, 2)^\ast$-dominating sets in some special graphs such as Cocktail Party Graph, Crown Graph, and Gear Graph. Correspondingly, the $[1, 2]$-domination number and $(1, 2)^\ast$-domination number are also obtained.
Zitieren
APA
Baluntang, R. A., & Malalay, R. P. (2026). $[1, 2]$- AND $(1, 2)^\ast$-DOMINATING SETS IN SOME SPECIAL GRAPHS. Advances and Applications in Discrete Mathematics, 43(7), 999-1014. https://doi.org/10.17654/0974165826060
Vancouver
Baluntang RA, Malalay RP. $[1, 2]$- AND $(1, 2)^\ast$-DOMINATING SETS IN SOME SPECIAL GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(7):999-1014. doi:10.17654/0974165826060
BibTeX
@article{Baluntang2026,
author = {Baluntang, Ronel A. and Malalay, Rolando P.},
title = {$[1, 2]$- AND $(1, 2)^\ast$-DOMINATING SETS IN SOME SPECIAL GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {7},
pages = {999--1014},
doi = {10.17654/0974165826060}
}
EUVIMED