Results 31 to 40 of about 10,626,776 (155)
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Restrained double Roman domination of a graph
, 2022 For a graph G = (V, E), a restrained double Roman dominating function is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0, then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(
Doost Ali Mojdeh +2 more
core +1 more source
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
Mathematics, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u)
Darja Rupnik Poklukar, Janez Žerovnik
doaj +1 more source
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
Mathematics, 2022 In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao +3 more
doaj +1 more source
Maximal double Roman domination in graphs
, 2022 A maximal double Roman dominating function (MDRDF) on a graph G = (V, E) is a function f:V(G)→{0,1,2,3} such that (i) every vertex v with f(v)=0 is adjacent to least two vertices assigned 2 or to at least one vertex assigned 3, (ii) every vertex v with f(
Chellali, M. +3 more
core +1 more source
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number [PDF]
, 2022 A 2-rainbow dominating function (2RDF) of a graph $G$ is a function $g$ from the vertex set $V (G)$ to the family of all subsets of $ \{1, 2\}$ such that for each vertex $v$ with $g(v) =\emptyset $ we have \( \bigcup_{u∈N(v)} g(u) = \{ 1, 2 \} \).
Poureidi, Abolfazl, Rad, Nader Jafari
core +1 more source
Signed double Roman domination on cubic graphs [PDF]
, 2023 The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
Iurlano, Enrico +3 more
core +3 more sources
Double Roman domination in generalized Petersen graphs P(ck, k)
, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3}, satisfying the condition that every vertex u for which f(u)=1 is adjacent to at least one vertex assigned 2 or 3, and every vertex u with f(u)=0 is adjacent to at ...
Janez Žerovnik +3 more
core +1 more source