Transversal Semitotal Domination Number in Graphs
Abstract
A transversal semitotal dominating set in a graph $G$ is a subset of vertices that intersects every minimal semitotal dominating set of \( G \) and itself forms a semitotal dominating set. Among all sets that intersect each semitotal dominating set of a graph \( G \), the one with the smallest cardinality defines a key parameter in the present study. This parameter is referred to as the transversal semitotal domination number and is denoted by \( \gamma_{tt2}(G) \). This paper investigates fundamental properties of this parameter in arbitrary graphs and determines exact values of \( \gamma_{tt2}(G) \) for several standard graph classes, including complete, star, wheel, cycle, path, and complete bipartite graphs.
Keywords
References
- G. Chartrand, L. Lesniak, Graphs and digraphs, Chapman and Hall, 1996.
- C. A. Barefoot, R. Entringer, H. Swart, Vulnerability in graphs: a comparative survey, Journal of Combinatorial Mathematics and Combinatorial Computing 1 (1987) 13--22.
- Ö. K. Kürkçü, E. Aslan, A comparison between edge neighbor rupture degree and edge scattering number in graphs, International Journal of Foundations of Computer Science 29 (07) (2018) 1119--1142.
- E. Aslan, Ö. K. Kürkçü, Edge scattering number of gear graphs, Bulletin of The International Mathematical Virtual Institute 5 (1) (2015) 25--31.
- T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of domination in graphs, CRC Press, 1998.
- E. J. Cockayne, R. W. Dawes, S. T. Hedetniemi, Total domination in graphs, Networks 10 (3) (1980) 211--219.
- W. Goddard, M. A. Henning, C. A. McPillan, Semitotal domination in graphs, Utilitas Mathematica 94 (2014) 67--81.
- T. W. Haynes, M. A. Henning, Trees with unique minimum semitotal dominating sets, Graphs and Combinatorics 36 (2020) 689--702.
Details
Primary Language
English
Subjects
Applied Mathematics (Other)
Journal Section
Research Article
Authors
Early Pub Date
September 30, 2025
Publication Date
September 30, 2025
Submission Date
June 16, 2025
Acceptance Date
September 22, 2025
Published in Issue
Year 2025 Number: 52
APA
Kartal Yıldız, Z. (2025). Transversal Semitotal Domination Number in Graphs. Journal of New Theory, 52, 1-8. https://doi.org/10.53570/jnt.1720611
AMA
1.Kartal Yıldız Z. Transversal Semitotal Domination Number in Graphs. JNT. 2025;(52):1-8. doi:10.53570/jnt.1720611
Chicago
Kartal Yıldız, Zeliha. 2025. “Transversal Semitotal Domination Number in Graphs”. Journal of New Theory, nos. 52: 1-8. https://doi.org/10.53570/jnt.1720611.
EndNote
Kartal Yıldız Z (September 1, 2025) Transversal Semitotal Domination Number in Graphs. Journal of New Theory 52 1–8.
IEEE
[1]Z. Kartal Yıldız, “Transversal Semitotal Domination Number in Graphs”, JNT, no. 52, pp. 1–8, Sept. 2025, doi: 10.53570/jnt.1720611.
ISNAD
Kartal Yıldız, Zeliha. “Transversal Semitotal Domination Number in Graphs”. Journal of New Theory. 52 (September 1, 2025): 1-8. https://doi.org/10.53570/jnt.1720611.
JAMA
1.Kartal Yıldız Z. Transversal Semitotal Domination Number in Graphs. JNT. 2025;:1–8.
MLA
Kartal Yıldız, Zeliha. “Transversal Semitotal Domination Number in Graphs”. Journal of New Theory, no. 52, Sept. 2025, pp. 1-8, doi:10.53570/jnt.1720611.
Vancouver
1.Zeliha Kartal Yıldız. Transversal Semitotal Domination Number in Graphs. JNT. 2025 Sep. 1;(52):1-8. doi:10.53570/jnt.1720611