16 results for "M. Chellali"
Showing 1–16 · 1.01 seconds · RSS
-
Journal Article
Quasi-total Roman reinforcement in graphs
AbstractA quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex in the subgraph induced by the set of…
-
Journal Article Full text
$k$-Efficient partitions of graphs
A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$% , we note that $\{U_1, U_2, \ldots U_t\}$ is a partition of the vertex set of…
-
Journal Article
The electrical properties of Au/GaN and PEDOT: PSS/GaN diodes
In the present paper, using a numerical simulator, the simulation of Au/n-GaN and PEDOT: PSS/GaN structures were performed in a temperature at room temperature. The electrical parameters: barrier height, ideality factor, shunt resistance series, and resistance have been calculated using different…
-
Journal Article
Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
A 2-emph{rainbow dominating function} (2RDF) on a graph $G=(V, E)$ is a function $f$ from the vertex set $V$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin V$ with $f(v)=emptyset$ the condition $bigcup_{uin N(v)}f(u)={1,2}$ is fulfilled. A 2RDF $f$ is independent (I2RDF)…
-
Journal Article
Varieties of Roman domination IV
Roman domination was introduced in 2004 by Cockayne, Dreyer, Hedetniemi, and Hedetniemi. If [Formula: see text] is the vertex set of a graph G, then a function [Formula: see text] is a Roman dominating function if every vertex [Formula: see text] for which [Formula: see text] is adjacent to at…
-
Journal Article
Restrained Italian reinforcement number in graphs
AbstractA restrained Italian dominating function (RID-function) on a graph [Formula: see text] is a function [Formula: see text] satisfying: (i) [Formula: see text] for every vertex [Formula: see text] with [Formula: see text], where [Formula: see text] is the set of vertices adjacent to u; (ii)…
-
Journal Article
On [k]-Roman domination subdivision number of graphs
AbstractLet [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. For a vertex [Formula: see text] the active neighbourhood AN(v) of v is the set of all vertices w adjacent to v…
-
Journal Article
On [k] -Roman domination in graphs
AbstractFor an integer [Formula: see text] let f be a function that assigns labels from the set [Formula: see text] to the vertices of a simple graph [Formula: see text]. The active neighborhood AN(v) of a vertex [Formula: see text] with respect to f is the set of all neighbors of v that are…
-
Journal Article
Further results on independent double roman trees
AbstractA double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v with f(v) = 1 is adjacent to at…
-
Journal Article
Varieties of Roman domination II
In this work, we continue to survey what has been done on the Roman domination. More precisely, we will present in two sections several variations of Roman dominating functions as well as the signed version of some of these functions. It should be noted that a first part of this survey comprising 9…
-
Journal Article
Hop total Roman domination in graphs
AbstractIn this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 there exists a vertex v at distance 2 from u with…
-
Journal Article
On the Outer-Independent Double Roman Domination of Graphs
An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h:V(G)→{0,1,2,3} such that i) every vertex v with f(v)=0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii) every vertex v with f(v)=1 is adjacent to at least one…
-
Journal Article
Independent k-rainbow bondage number of graphs
AbstractFor an integer [Formula: see text] an independent k-rainbow dominating function (IkRDF for short) on a graph G is a function g that assigns to each vertex a set of colors chosen from the subsets of [Formula: see text] satisfying the following conditions: (i) if [Formula: see text], then…
-
Journal Article
An improved upper bound on the independent double Roman domination number of trees
AbstractFor a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least two neighbors x and y such that [Formula: see…
-
Journal Article
Further results on outer independent triple Roman domination
An outer-independent triple Roman dominating function (OI[3]RDF) on a graph [Formula: see text] is function [Formula: see text] having the property that (i) if [Formula: see text] then v must have either a neighbor assigned 4 or two neighbors one of which is assigned 3 and the other at least 2 or v…
-
Journal Article
Quasi total double Roman domination in graphs
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3; (ii) if f(v) = 1, then vertex…