7 days ago · A subset S S of vertices of a digraph D D is a total 2 2 -dominating set if every vertex not in S S is adjacent from at least two vertices ...
A subset S of vertices of a digraph D is a total 2-dominating set if every vertex not in S is adjacent from at least two vertices in S, and the subdigraph.
Discussiones Mathematicae Graph Theory (Jan 2023). Total 2-domination number in digraphs and its dual parameter. Doost Ali Mojdeh,; Babak Samadi.
A subset $S$ of vertices of a digraph $D$ is a total $2$-dominating set if every vertex not in $S$ is adjacent from at least two vertices in $S$, and the ...
Jul 15, 2023 · The double total domination number of G , denoted by γ × 2 , t ( G ) , is the minimum cardinality among all DTDSs of G . More recently, other ...
Missing: digraphs dual
Jul 23, 2019 · The double domination number (total 2-domination number) of a digraph D is the minimum cardinality of a double dominating set (total 2- ...
Missing: parameter. | Show results with:parameter.
Bibliographic details on Total 2-domination number in digraphs and its dual parameter.
A subset $S$ of vertices of a digraph $D$ is a total $2$-dominating set if every vertex not in $S$ is adjacent from at least two vertices in $S$, and the ...
Sep 9, 2024 · A subset S S of vertices of a digraph D D is a double dominating set (total 2 2 -dominating set) if every vertex not in S S is adjacent from ...
In this paper, we initiate the study of the total double Roman domination number in digraphs and show its relationship to other domination parameters.