Search
Now showing items 1-6 of 6
Some new results on the k-tuple domination number of graphs
(EDP Sciences, 2022)
Let k ≥ 1 be an integer and G be a graph of minimum degree δ(G) ≥ k − 1. A set D ⊆ V(G) is said to be a k-tuple dominating set of G if |N[v] ∩ D| ≥ k for every vertex v ∈ V(G), where N[v] represents the closed neighbourhood ...
On the {2}-domination number of graphs
(AIMS Press, 2022)
New Bounds on the Double Total Domination Number of Graphs
(Springer, 2022)
Double domination in rooted product graphs
(Elsevier, 2023)
Double domination in lexicographic product graphs
(Elsevier, 2020)
In a graph G, a vertex dominates itself and its neighbours. A subset S ⊆ V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating ...