Results 31 to 40 of about 776,655 (324)
On the Total Double Roman Domination [PDF]
IEEE Access, 2019 Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under f ...
Zehui Shao +3 more
doaj +3 more sources
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
Discussiones Mathematicae Graph Theory, 2013 A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V −→ {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2.
Chellali Mustapha, Rad Nader Jafari
doaj +3 more sources
More results on the signed double Roman domination number of graphs
AKCE International Journal of Graphs and CombinatoricsA signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +2 more sources
Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems [PDF]
arXiv.org, 2023 Roman domination is a well researched topic in graph theory. Recently two new variants of Roman domination, namely triple Roman domination and quadruple Roman domination problems have been introduced, to provide better defense strategies. However, triple
Sanath Kumar Vengaldas +3 more
openalex +3 more sources
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 +1 more source
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
Fundamenta Informaticae, 2022 The aim of this paper is to obtain closed formulas for the perfect domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs. We show that these formulas can be obtained relatively easily for the case of the first two parameters.
Martinez, A. Cabrera +2 more
openaire +3 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
On the Quasi-Total Roman Domination Number of Graphs
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 +1 more source
Algorithmic Results for Weak Roman Domination Problem in Graphs [PDF]
Discrete Applied MathematicsConsider a graph $G = (V, E)$ and a function $f: V \rightarrow \{0, 1, 2\}$. A vertex $u$ with $f(u)=0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex with a positive $f$-value.
Kaustav Paul, Ankit Sharma, Arti Pandey
openalex +2 more sources
A note on the bounds of Roman domination numbers
AIMS Mathematics, 2021 Let $G$ be a graph and $f: V(G) \rightarrow \{0,1,2\}$ be a mapping. $f$ is said to be a Roman dominating function of $G$ if every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v)=2$.
Zepeng Li
doaj +1 more source