Results 41 to 50 of about 1,397,008 (283)
Total dominator total chromatic numbers of cycles and paths
RAIRO - Operations Research, 2023 The total dominator total coloring of a graph is a total coloring of the graph such that each object (vertex or edge) of the graph is adjacent or incident to every object of some color class. The minimum number of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. In (A.P.
Adel P. Kazemi, Farshad Kazemnejad
openaire +2 more sources
Results on the domination number and the total domination number of Lucas cubes
Ars Mathematica Contemporanea, 2020 Summary: Lucas cubes are the special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we present the exact values of total domination number of small dimensional Lucas cubes and present ...
openaire +2 more sources
Turkish Journal of Mathematics, 2020 : In graph theory, domination number and its variants such as total domination number are studied by many authors. Let the domination number and the total domination number of a graph G without isolated vertices be γ ( G ) and γ t ( G ) , respectively ...
Selim Bahadır
semanticscholar +1 more source
On the Quasi-Total Roman Domination Number of Graphs
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 +1 more source
Total 2-rainbow domination numbers in trees
Discussiones Mathematicae Graph Theory, 2021 A function \(f:V(G) \rightarrow 2^{\{1,2\}}\) is a \(2\)-rainbow dominating function (2RDF) of a graph \(G\) if for every vertex \(v\) with \(f(v) = \emptyset\) we have \(\cup_{u\in N(v)} f(u) = \{1,2\}\). A 2RDF \(f\) is a total 2-rainbow dominating function (T2RDF) if the subgraph induced by the vertices \(v\) with \(f(v) \ne \emptyset\) has no ...
Ahangar H. Abdollahzadeh +4 more
openaire +3 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 +1 more source
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 +1 more source
Effect of predomination and vertex removal on the game total domination number of a graph [PDF]
Discrete Applied Mathematics, 2018 The game total domination number, ${\gamma_{g}^{t}}$, was introduced by Henning et al.\ in 2015. In this paper we study the effect of vertex predomination on the game total domination number. We prove that ${\gamma_{g}^{t}}(G|v) \geq {\gamma_{g}^{t}}(G) -
Vesna Iršič
semanticscholar +1 more source
Total restrained domination numbers of trees
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joanna Raczek, Joanna Cyman
openaire +1 more source
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 +1 more source