Results 11 to 20 of about 11,159 (184)
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 +3 more sources
Graphs with large disjunctive total domination number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Michael A. Henning, Viroshan Naicker
doaj +5 more sources
Trees with Large Neighborhood Total Domination Number
Discrete Applied Mathematics, 2014 13 ...
Michael A. Henning, Kirsti Wash
openalex +5 more sources
Outer independent total double Italian domination number [PDF]
Computer Science Journal of MoldovaIf $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ satisfying (i) $f(N[u])\ge 3 ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +3 more sources
Total domination number of grid graphs
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylvain Gravier
openalex +2 more sources
Graphs with Total Domination Number Double of the Matching Number
Journal of New TheoryA subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj +2 more sources
On the inverse signed total domination number in graphs [PDF]
Opuscula Mathematica, 2017 In this paper, we study the inverse signed total domination number in graphs and present new sharp lower and upper bounds on this parameter. For example by making use of the classic theorem of Turán (1941), we present a sharp upper bound on \(K_{r+1 ...
D. A. Mojdeh, B. Samadi
doaj +5 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
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
Total dominator chromatic number of a graph [PDF]
Transactions on Combinatorics, 2015 Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj +3 more sources