Results 11 to 20 of about 1,397,008 (283)
Total Domination Multisubdivision Number of a Graph
Discussiones Mathematicae Graph Theory, 2015 The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
doaj +4 more sources
Minimum Randić Index of Trees with Fixed Total Domination Number
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 +2 more sources
On the domination number and the total domination number of Fibonacci cubes
Ars Mathematica Contemporanea, 2019 Fibonacci cubes are special subgraphs of the hypercube graphs. Their domination numbers and total domination numbers are obtained for some small dimensions by integer linear programming.
Elif Saygı
semanticscholar +6 more sources
On the Secure Total Domination Number of Graphs [PDF]
Symmetry, 2019 A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex u ∈ V ( G ) \ D , there exists a vertex v ∈ D , which is adjacent to u, such that ( D \ { v } ) ∪ { u } is a total dominating set as well.
Abel Cabrera Martínez +2 more
semanticscholar +2 more sources
Bounding the k-rainbow total domination number [PDF]
Discrete Mathematics, 2020 Recently the notion of $k$-rainbow total domination was introduced for a graph $G$, motivated by a desire to reduce the problem of computing the total domination number of the generalized prism $G \Box K_k$ to an integer labeling problem on $G$.
Kerry Ojakian +2 more
semanticscholar +5 more sources
Graphs with large disjunctive total domination number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Michael A. Henning, Viroshan Naicker
doaj +4 more sources
Total Outer-Independent Domination Number: Bounds and Algorithms
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
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 +7 more sources
The Domination Parameters on a kind of the regular honeycomb structure [PDF]
Computer Science Journal of Moldova, 2022 The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One
Fateme Movahedi +2 more
doaj +1 more source
Bounds On The Disjunctive Total Domination Number Of A Tree
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj +2 more sources