Results 21 to 30 of about 2,224,899 (247)
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 +2 more sources
Upper Bounds for Double Roman Domination and [k]-Roman Domination of Cylindrical Graphs Cm☐Pn [PDF]
AxiomsRoman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, [k]-Roman domination provides a unified framework that generalizes Roman, double Roman, and ...
Simon Brezovnik, Janez Žerovnik
doaj +2 more sources
Signed double Roman domination on cubic graphs [PDF]
Applied Mathematics and Computation, 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. Here feasibility is given whenever (i) vertices labeled $\pm{}1$ have at least one neighbor with label in $\{2,3\}$; (ii) each ...
Enrico Iurlano +3 more
core +8 more sources
Total double Roman domination in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one ...
Guoliang Hao +2 more
doaj +1 more source
Bounds on signed total double Roman domination [PDF]
Communications in Combinatorics and Optimization, 2020 A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi +3 more
doaj +1 more source
Calculating Modern Roman Domination of Fan Graph and Double Fan Graph [PDF]
Journal of Applied Sciences and Nanotechnology, 2022 This paper is concerned with the concept of modern Roman domination in graphs. A Modern Roman dominating function on a graph is labeling such that every vertex with label 0 is adjacent to two vertices; one of them of label 2 and the other of label 3 and ...
Saba Salah, Ahmed Omran, Manal Al-Harere
doaj +1 more source
Lower and upper bounds on independent double Roman domination in trees
Electronic Journal of Graph Theory and Applications, 2022 For a graph G = (V, E), a double Roman dominating function (DRDF) f : V → {0, 1, 2, 3} has the property that for every vertex v ∈ V with f(v)=0, either there exists a neighbor u ∈ N(v), with f(u)=3, or at least two neighbors x, y ∈ N(v) having f(x)=f(y ...
M. Kheibari +3 more
doaj +1 more source
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source
Bounds on the global double Roman domination number in graphs [PDF]
Discussiones Mathematicae Graph TheoryLet $G$ be a simple graph of order $n$ and let $\gamma_{gdR}(G)$ be the global double Roman domination number of $G$. In this paper, we give some upper bounds on the global double Roman domination number of $G$.
Guoliang Hao +3 more
doaj +2 more sources
Anarchism and non-domination [PDF]
, 2019 In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402) +1 more
core +6 more sources