Results 11 to 20 of about 1,521,521 (318)
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 +5 more sources
Total and Double Total Domination Number on Hexagonal Grid [PDF]
Mathematics, 2019 In this paper, we determine the upper and lower bound for the total domination number and exact values and the upper bound for the double-total domination number on hexagonal grid H m , n with m hexagons in a row and n hexagons in a column ...
Antoaneta Klobučar, Ana Klobučar
doaj +3 more sources
Results on the domination number and the total domination number of Lucas cubes
Ars Mathematica Contemporanea, 2020 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.
Zülfükar Saygı
semanticscholar +4 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 +7 more sources
On Grundy Total Domination Number in Product Graphs
Discussiones Mathematicae Graph Theory, 2021 A longest sequence (v1, . . ., vk) of vertices of a graph G is a Grundy total dominating sequence of G if for all i, N(υj)\∪j=1i-1N(υj)≠∅N({\upsilon _j})\backslash \bigcup\nolimits_{j = 1}^{i - 1} {N({\upsilon _j})} \ne \emptyset .
Brešar Boštjan +8 more
doaj +8 more sources
Double Total Domination Number on Some Chemical Nanotubes [PDF]
Kragujevac Journal of MathematicsSuppose G is a graph with the vertex set V (G). A set D ⊆ V (G) is a total k-dominating set if every vertex v ∈ V (G) has at least k neighbours in D. The total k-domination number γkt(G) is the size of the smallest total k-dominating set.
Ana Klobučar, Antoaneta Klobučar
semanticscholar +4 more sources
Total $k$-rainbow domination subdivision number in graphs [PDF]
Computer Science Journal of Moldova, 2020 A total $k$-rainbow dominating function (T$k$RDF) of $G$ is a function $f$ from the vertex set $V(G)$ to the set of all subsets of the set $\{1,\ldots,k\}$ such that (i) for any vertex $v\in V(G)$ with $f(v)=\emptyset$ the condition $\bigcup_{u \in N(v ...
Rana Khoeilar +3 more
doaj +3 more sources
Fair Total Domination Number in Cactus Graphs
Discussiones Mathematicae Graph Theory, 2021 For k ≥ 1, a k-fair total dominating set (or just kFTD-set) in a graph G is a total dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V\S. The k-fair total domination number of G, denoted by ftdk(G), is the minimum cardinality of a kFTD-set.
Hajian Majid, Rad Nader Jafari
doaj +3 more sources
Properties of the Global Total k-Domination Number [PDF]
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 +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