Results 31 to 40 of about 369,294 (274)
Complementary total domination in graphs [PDF]
, 2007 Let D be a minimum total dominating set of G. If V−D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D.
Chaluvaraju, B., Soner, N.D.
core +1 more source
Total [1,2]-domination in Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2018 17 ...
Lv, Xue-Zheng, Wu, Baoyindureng
openaire +2 more sources
Total Domination in Partitioned Graphs [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frendrup, Allan +2 more
openaire +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 +1 more source
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +1 more source
Properties of the Global Total k-Domination Number
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 +1 more source
On the Complexity of Reinforcement in Graphs
Discussiones Mathematicae Graph Theory, 2016 We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.
Rad Nader Jafari
doaj +1 more source
On a conjecture concerning total domination subdivision number in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be the total domination number and let be the total domination subdivision number of a graph G with no isolated vertex. In this paper, we show that for some classes of graphs G, which partially solve the conjecture presented by Favaron et al.
S. Kosari +5 more
doaj +1 more source
Total 2-Rainbow Domination in Graphs
Mathematics, 2022 A total k-rainbow dominating function on a graph G=(V,E) is a function f:V(G)→2{1,2,…,k} such that (i) ∪u∈N(v)f(u)={1,2,…,k} for every vertex v with f(v)=∅, (ii) ∪u∈N(v)f(u)≠∅ for f(v)≠∅.
Huiqin Jiang, Yongsheng Rao
doaj +1 more source
Some notes on the isolate domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2017 A subset of vertices of a graph is a dominating set of if every vertex in has a neighbor in . The domination number is the minimum cardinality of a dominating set of . A dominating set is an isolate dominating set if the induced subgraph has at least one
Nader Jafari Rad
doaj +1 more source