Results 1 to 10 of about 990 (254)
Some Results on the Strong Roman Domination Number of Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every vertex v for which f(v)=0 is
Akram Mahmoodi +2 more
doaj +2 more sources
Maximum Second Zagreb Index Of Trees With Given Roman Domination Number [PDF]
Transactions on Combinatorics, 2023 Chemical study regarding total $\pi$-electron energy with respect to conjugated molecules has focused on the second Zagreb index of graphs. Moreover, in the last half-century, it has gotten a lot of attention.
Ayu Ameliatul Ahmad Jamri +3 more
doaj +2 more sources
On the Quasi-Total Roman Domination Number of Graphs [PDF]
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
doaj +2 more sources
Critical graphs with Roman domination number four [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A Roman domination function on a graph G is a function satisfying the condition that every vertex u for which r(u) = 0 is adjacent to at least one vertex v for which r(v) = 2.
A. Martínez-Pérez, D. Oliveros
doaj +2 more sources
Triple Roman domination subdivision number in graphs [PDF]
Computer Science Journal of Moldova, 2022 For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)\longrightarrow\{0, 1, 2, 3, 4\}$ having the property that for any vertex $v\in V(G)$, if $f(v)
Jafar Amjadi, Hakimeh Sadeghi
doaj +3 more sources
Extremal Graphs for a Bound on the Roman Domination Number
Discussiones Mathematicae Graph Theory, 2020 A Roman dominating function on a graph G = (V, E) is a function f:V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value w(f) = Σu∈V(G)f(u).
Bouchou Ahmed +2 more
doaj +2 more sources
On [k]-Roman domination subdivision number of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be an integer and G a simple graph with vertex set V(G). Let f be a function that assigns labels from the set [Formula: see text] to the vertices of G.
K. Haghparast +3 more
doaj +2 more sources
Perfect Roman {3}-Domination in Graphs: Complexity and Bound of Perfect Roman {3}-Domination Number of Trees [PDF]
Journal of MathematicsA perfect Roman 3-dominating function on a graph G=V,E is a function f:V⟶0,1,2,3 having the property that if fv=0, then ∑u∈Nvfu=3, and if fv=1, then ∑u∈Nvfu=2 for any vertex v∈V.
Ahlam Almulhim
doaj +2 more sources
Roman game domination subdivision number of a graph [PDF]
Transactions on Combinatorics, 2013 A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a
Jafar Amjadi +3 more
doaj +1 more source
An Upper Bound for the Eternal Roman Domination Number [PDF]
MathematicsImagine using mobile guards to defend the vertices of a graph G from a sequence of attacks subject to the conditions that after each attack: (i) each guard either remains in place or moves to an adjacent vertex; (ii) the configuration of guards forms a ...
Richard Brewster +2 more
doaj +2 more sources