Furthermore, we extend our study to wheel related structures such as gear, helm, and web graphs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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$.
📊
Key Findings & Data: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$.
💡
Conclusion & Impact:Furthermore, we extend our study to wheel related structures such as gear, helm, and web graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Disjunctive total domination subdivision · Fan graph · Claw-free graph
Abstract
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.
Çiftçi, C. (2026). Disjunctive Total Domination Subdivision Number of Cycle and Wheel Related Graphs. Fundamental Journal of Mathematics and Applications, Volume: 9 Issue: 2. https://doi.org/10.33401/fujma.1862064
C. Çiftçi, Disjunctive total domination of some shadow distance graphs, Fundam. J. Math. Appl., 3(2) (2020), 185–193. $\href{https://doi.org/10.33401/fujma.790046}{\mbox{[CrossRef]}} $
T. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, D. Jacobs, J. Knisely and L. Van Der Merwe, Domination subdivision numbers, Discuss. Math. Graph Theory, 21(2) (2001), 239–253.$ \href{https://doi.org/10.7151/dmgt.1147 }{\mbox{[CrossRef]}} $
T. Haynes, M. Henning and L. Hopkins, Total domination subdivision numbers of graphs, Discuss. Math. Graph Theory, 24(3) (2004), 457–467. $ \href{https://doi.org/10.7151/dmgt.1244 }{\mbox{[CrossRef]}} $
A. Aytaç and B. Atay, On domination of a vertex as exponentially, Bull. Int. Math. Virtual Inst., 8 (2018), 271–278. $ \href{https://doi.org/10.7251/BIMVI1802271A}{\mbox{[CrossRef]}} $