Results 31 to 40 of about 1,397,008 (283)
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
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. Ervani, Dafik, I. Tirta
semanticscholar +1 more source
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 +1 more source
Properties of the Global Total k-Domination Number
Mathematics, 2021 A nonempty subset D⊂V of vertices of a graph G=(V,E) is a dominating set if every vertex of this graph is adjacent to at least one vertex from this set except the vertices which belong to this set itself.
Frank A. Hernández Mira +3 more
doaj +1 more source
A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices [PDF]
Opuscula Mathematica, 2020 A subset \(D\) of the vertex set \(V\) of a graph \(G\) is called an \([1,k]\)-dominating set if every vertex from \(V-D\) is adjacent to at least one vertex and at most \(k\) vertices of \(D\).
Narges Ghareghani +2 more
doaj +1 more source
Trees with equal total domination and game total domination numbers
Discrete Applied Mathematics, 2017 In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices totally dominated, where a vertex totally dominates another vertex if they are ...
Michael A. Henning, Douglas F. Rall
openaire +3 more sources
On a conjecture concerning total domination subdivision number in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be the total domination number and let be the total domination subdivision number of a graph G with no isolated vertex. In this paper, we show that for some classes of graphs G, which partially solve the conjecture presented by Favaron et al.
S. Kosari +5 more
doaj +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Total domination game on ladder graphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 The total domination game is played on a simple graph G by two players, named Dominator and Staller. They alternately select a vertex of G; each chosen vertex totally dominates its neighbors.
Karnchana Charoensitthichai +1 more
doaj +1 more source
Total domination and total domination subdivision number of a graph and its complement
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron +2 more
openaire +2 more sources