Domination parameters of generalized Sierpiński graphs
In this paper, we obtain the Italian domination number, perfect Italian domination number
and double Roman domination number of generalized Sierpiński graph S (G, 2), where G is …
and double Roman domination number of generalized Sierpiński graph S (G, 2), where G is …
[PDF][PDF] Total and paired domination numbers and γ-total and γ-paired dominating graphs of some graphs
P Eakawinrujee, N Trakultraipruk - 2023 - ethesisarchive.library.tu.ac.th
Let G be a graph without isolated vertices. A total dominating set of G is a set D⊆ V (G) such
that every vertex of G is adjacent to at least one vertex in D. A paired dominating set of G is a …
that every vertex of G is adjacent to at least one vertex in D. A paired dominating set of G is a …
Power dominator chromatic numbers of splitting graphs of certain classes of graphs
Domination in graphs and coloring of graphs are two main areas of investigation in graph
theory. Power domination is a variant of domination in graphs introduced in the study of the …
theory. Power domination is a variant of domination in graphs introduced in the study of the …
Some new results on captive dominating sets in graphs.
A dominating set D⊂ V (G) is said to be a captive dominating set of G if< D> has no isolated
vertex (D is a total dominating set) and each vertex v∈ D is adjacent to at least one vertex in …
vertex (D is a total dominating set) and each vertex v∈ D is adjacent to at least one vertex in …