Results 1 to 10 of about 313,249 (265)
Graphs with large disjunctive total domination number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Michael A. Henning, Viroshan Naicker
doaj +6 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 +4 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
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
Computing locating-total domination number in some rotationally symmetric graphs [PDF]
Science Progress, 2021 Let G = ( V , E ) be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G , for every pair of vertices i , j ∈ V ( G ) ∖ S , such that N ( i ) ∩ S ≠ N ( j ) ∩ S .
Hassan Raza +3 more
doaj +2 more sources
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 +2 more sources
On the total domination number of total graphs
Discussiones Mathematicae Graph TheorySummary: Let \(G\) be a graph with no isolated vertex. A set \(D\subseteq V(G)\) is a total dominating set of \(G\) if every vertex of \(G\) is adjacent to at least one vertex in \(D\). The total domination number of \(G\), denoted by \(\gamma_t(G)\), is the minimum cardinality among all total dominating sets of \(G\).
Abel Cabrera-Martínez +2 more
doaj +4 more sources
3-Tuple Total Domination Number of Rook’s Graphs
Discussiones Mathematicae Graph Theory, 2022 A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by γ×k,t(G).
Pahlavsay Behnaz +2 more
doaj +3 more sources
Total domination number of middle graphs
Electronic Journal of Graph Theory and Applications, 2022 A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set.
Farshad Kazemnejad +3 more
doaj +4 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