Results 1 to 10 of about 1,521,521 (318)
Graphs with large disjunctive total domination number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Michael A. Henning, Viroshan Naicker
doaj +7 more sources
Total domination number of middle graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2022 A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set.
Farshad Kazemnejad +3 more
doaj +7 more sources
On the total domination number of total graphs
Discussiones Mathematicae Graph Theory, 2022 Let G be a graph with no isolated vertex. A set D ⊆ V (G) is a total dominating set of G if every vertex of G is adjacent to at least one vertex in D.
Abel Cabrera-Martínez +2 more
doaj +5 more sources
3-Tuple Total Domination Number of Rook’s Graphs
Discussiones Mathematicae Graph Theory, 2022 A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by γ×k,t(G).
Pahlavsay Behnaz +2 more
doaj +4 more sources
New Bounds on the Signed Total Domination Number of Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥
Moghaddam Seyyed Mehdi Hosseini +3 more
doaj +4 more sources
Minimum Randić Index of Trees with Fixed Total Domination Number [PDF]
Mathematics, 2022 The Randić index is among the most famous degree-based topological indices in chemical graph theory. It was introduced due to its application in modeling the properties of certain molecular structures and has been extensively studied.
Ayu Ameliatul Shahilah Ahmad Jamri +4 more
doaj +3 more sources
Double total domination number in certain chemical graphs
AIMS Mathematics, 2022 Let $ G $ be a graph with the vertex set $ V(G) $. A set $ D\subseteq V(G) $ is a total k-dominating set if every vertex $ v\in V(G) $ has at least $ k $ neighbours in $ D $.
Ana Klobučar Barišić +1 more
doaj +3 more sources
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Sci Prog, 2021 Let G = ( V , E ) be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices i , j ∈ V ( G ) ∖ S , such that N ( i ) ∩ S ≠ N ( j ) ∩ S .
Raza H, Iqbal N, Khan H, Botmart T.
europepmc +2 more sources
The analysis of the implementation of problem-based learning students’ generalization skills in obtaining the resolving total domination number [PDF]
Journal of Physics: Conference Series, 2021 Problem Based Learning (PBL) is a way to form and teach using problems as a stimulus and focus for student activities. Student generalization skills are one of the skills that can be improved using PBL.
R S R Ervani, Dafik Dafik, I Made Tirta
openalex +2 more sources
Further results on the total Italian domination number of trees
AIMS Mathematics, 2023 Let $ f:V(G)\rightarrow \{0, 1, 2\} $ be a function defined from a connected graph $ G $. Let $ W_i = \{x\in V(G): f(x) = i\} $ for every $ i\in \{0, 1, 2\} $. The function $ f $ is called a total Italian dominating function on $ G $ if $ \sum_{v\in N(x)}
Abel Cabrera-Martínez +2 more
doaj +2 more sources