نتایج جستجو برای: double roman domination number
تعداد نتایج: 1401394 فیلتر نتایج به سال:
A double Roman dominating function on a graph G=(V,E) is f:V?{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 adjacent to at least one assigned 3 or two vertices 2, and with f(u)=1 2 3. The weight of f equals w(f)=?v?Vf(v). domination number ?dR(G) G minimum G. We obtain closed expressions generalized Petersen graphs P(5k,k). It proven ?dR(P(5k,k))=8k k?2,3mod5 8k??dR(P(5...
In a graph G = (V (G), E(G)), a vertex dominates itself and its neighbors. A subset S of V (G) is a double dominating set if every vertex of V (G) is dominated at least twice by the vertices of S. The double domination number of G is the minimum cardinality among all double dominating sets of G. We consider the effects of edge removal on the double domination number of a graph. We give a necess...
The following fundamental result for the domination number γ(G) of a graph G was proved by Alon and Spencer, Arnautov, Lovász and Payan: γ(G) ≤ ln(δ + 1) + 1 δ + 1 n, where n is the order and δ is the minimum degree of vertices of G. A similar upper bound for the double domination number was found by Harant and Henning [On double domination in graphs. Discuss. Math. Graph Theory 25 (2005) 29–34...
Let $D$ be a finite and simple digraph with vertex set $V(D)$.A signed total Roman $k$-dominating function (STR$k$DF) on$D$ is a function $f:V(D)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each$vin V(D)$, where $N^{-}(v)$ consists of all vertices of $D$ fromwhich arcs go into $v$, and (ii) every vertex $u$ for which$f(u)=-1$ has a...
Dominating sets in their many variations model a wealth of optimization problems like facility location or distributed le sharing. For instance, when a request can occur at any node in a graph and requires a server at that node, a minimumdominating set represents a minimum set of servers that serve an arbitrary single request by moving a server along at most one edge. This paper studies dominat...
a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$. a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$. a geodetic dominating set $s$ is both a geodetic and a dominating set. the geodetic (domination, geodetic domination) number...
Domination-type parameters are difficult to manage in Cartesian product graphs and there is usually no general relationship between the parameter both factors graph. This situation of domination number, Roman number or 2-domination among others. Contrary what happens with remains unknown cylinders, that is, a cycle path this paper, we will compute cylinders small cycles. We develop two algorith...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید