Results 51 to 60 of about 13,369 (211)
On the Total Version of Triple Roman Domination in Graphs
MathematicsIn this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from {0,1,2,3,4} to the vertices of a graph such that every vertex is protected by at least three units either on itself or ...
Juan Carlos Valenzuela-Tripodoro +3 more
doaj +1 more source
On the Total Outer k-Independent Domination Number of Graphs
Mathematics, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez +3 more
doaj +1 more source
On the Game Total Domination Number [PDF]
Graphs and Combinatorics, 2018 11 ...
openaire +3 more sources
Total dominating sequences in graphs
Discrete Mathematics, 2016 A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally ...
Douglas F. Rall +2 more
openaire +3 more sources
On Total Domination in the Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2018 Ho proved in [A note on the total domination number, Util. Math. 77 (2008) 97–100] that the total domination number of the Cartesian product of any two graphs without isolated vertices is at least one half of the product of their total domination numbers.
Brešar Boštjan +3 more
doaj +1 more source
Total [1,2]-domination in Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2018 17 ...
Baoyindureng Wu, Xuezheng Lv
openaire +3 more sources
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Total domination and total domination subdivision number of a graph and its complement
Discrete Mathematics, 2008 AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γt(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt(G) is the minimum number of edges that must be subdivided in ...
Odile Favaron +2 more
openaire +2 more sources
Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph [PDF]
, 2022 Michael A. Henning, Ernst J. Joubert
openalex +1 more source