Disjunctive Total Domination Subdivision Number of Cycle and Wheel Related Graphs
Fundamental Journal of Mathematics and Applications · 30.06.2026 · 9 (2) · 113-122
DOI: 10.33401/fujma.1862064 ↗Kurz gefasst
Fachartikel in der Zeitschrift Fundamental Journal of Mathematics and Applications, online erschienen am 30.06.2026. Verfasst von Canan Çiftçi. Die Arbeit nennt 26 Literaturangaben.
Abstract (Originalsprache)
A set $S \subseteq V(G)$ is a disjunctive total dominating set of $G$ if each vertex $u \in V(G)$ is either adjacent to a vertex in $S$ or is at distance two from at least two vertices in $S$. The minimum cardinality of a disjunctive total dominating set is the disjunctive total domination number. The disjunctive total domination subdivision number is the minimum number of edges that must be subdivided (each edge can be subdivided at most once) to increase the disjunctive total domination number of $G$. In this paper, we investigate the disjunctive total domination and its corresponding subdivision number for various cycle related graphs, including generalized fan, claw-free, and $k$-pyramid graphs. Furthermore, we extend our study to wheel related structures such as gear, helm, and web graphs.
Zitieren
APA
Çiftçi, C. (2026). Disjunctive Total Domination Subdivision Number of Cycle and Wheel Related Graphs. Fundamental Journal of Mathematics and Applications, 9(2), 113-122. https://doi.org/10.33401/fujma.1862064
Vancouver
Çiftçi C. Disjunctive Total Domination Subdivision Number of Cycle and Wheel Related Graphs. Fundamental Journal of Mathematics and Applications. 2026;9(2):113-122. doi:10.33401/fujma.1862064
BibTeX
@article{ifti2026,
author = {Çiftçi, Canan},
title = {Disjunctive Total Domination Subdivision Number of Cycle and Wheel Related Graphs},
journal = {Fundamental Journal of Mathematics and Applications},
year = {2026},
volume = {9},
number = {2},
pages = {113--122},
doi = {10.33401/fujma.1862064}
}
EUVIMED