Results 21 to 30 of about 1,521,521 (318)
Total Roman Domination Number of Rooted Product Graphs [PDF]
Mathematics, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +2 more sources
Double total domination number of Cartesian product of paths
AIMS Mathematics, 2023 A vertex set $ S $ of a graph $ G $ is called a double total dominating set if every vertex in $ G $ has at least two adjacent vertices in $ S $. The double total domination number $ \gamma_{\times 2, t}(G) $ of $ G $ is the minimum cardinality over all ...
Linyu Li , Jun Yue, Xia Zhang
doaj +2 more sources
Bounding the locating-total domination number of a tree in terms of its annihilation number
Discussiones Mathematicae Graph Theory, 2018 Suppose G = (V,E) is a graph with no isolated vertex. A subset S of V is called a locating-total dominating set of G if every vertex in V is adjacent to a vertex in S, and for every pair of distinct vertices u and v in V −S, we have N(u) ∩ S ≠ N(v) ∩ S ...
Mei Lu, Wenjie Ning, Kun Wang
openalex +2 more sources
On the Game Total Domination Number [PDF]
Graphs and Combinatorics, 2017 The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph G. Each vertex chosen must strictly increase the number of vertices totally dominated.
Csilla Bujtás
semanticscholar +4 more sources
Locating-Total Domination Number in Strong Product of Two Paths
, 2020 In a monitoring system, each node's status is unique, and the system can accurately locate the node when there is a problem, which can be modeled through graphs’ locating-total domination.
Wei Kang, Jianping Li, Zhemin Li
openalex +3 more sources
On a Class of Graphs with Large Total Domination Number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +3 more sources
Total Outer-Independent Domination Number: Bounds and Algorithms [PDF]
AlgorithmsIn graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V,E); a subset of its vertices is a total dominating set (TDS) if, for each x∈V(G), there exists an
Paul Bosch +3 more
doaj +2 more sources
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +2 more sources
On the Quasi-Total Roman Domination Number of Graphs [PDF]
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
doaj +2 more sources
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs [PDF]
Discrete Mathematics, 2021 Hongbo Hua +3 more
openalex +3 more sources