نتایج جستجو برای: double roman domination number

تعداد نتایج: 1401394  

Journal: :International Journal of Research in Engineering and Technology 2013

Journal: :Australasian J. Combinatorics 2011
P. Roushini Leely Pushpam T. N. M. Malini Mai

Let G = (V,E) be a graph and let f be a function f : E → {0, 1, 2}. An edge x with f(x) = 0 is said to be undefended with respect to f if it is not incident to an edge with positive weight. The function f is a weak edge Roman dominating function (WERDF) if each edge x with f(x) = 0 is incident to an edge y with f(y) > 0 such that the function f ′ : E → {0, 1, 2}, defined by f ′(x) = 1, f ′(y) =...

Journal: :Symmetry 2021

Let G be a graph with no isolated vertex and let N(v) the open neighbourhood of v∈V(G). f:V(G)→{0,1,2} function Vi={v∈V(G):f(v)=i} for every i∈{0,1,2}. We say that f is strongly total Roman dominating on if subgraph induced by V1∪V2 has N(v)∩V2≠∅ v∈V(G)\V2. The domination number G, denoted γtRs(G), defined as minimum weight ω(f)=∑x∈V(G)f(x) among all functions G. This paper devoted to study it ...

Journal: :communication in combinatorics and optimization 0
vladimir samodivkin university of architecture, civil еngineering and geodesy; department of mathematics

for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...

Journal: :transactions on combinatorics 2013
nasrin dehgardai sepideh norouzian seyed mahmoud sheikholeslami

a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...

2005
VLADIMIR D. SAMODIVKIN

Let G be a graph of order n ≥ 2 and n1, n2, .., nk be integers such that 1 ≤ n1 ≤ n2 ≤ .. ≤ nk and n1 + n2 + .. + nk = n. Let for i = 1, .., k: Ai ⊆ Kni where Km is the set of all pairwise non-isomorphic graphs of order m, m = 1, 2, ... In this paper we study when for a domination related parameter μ (such as domination number, independent domination number and acyclic domination number) is ful...

Journal: :Mathematics 2021

A double Roman dominating function on a graph G=(V,E) is f:V?{0,1,2,3} with the properties that if f(u)=0, then vertex u adjacent to at least one assigned 3 or two vertices 2, and f(u)=1, 2 3. The weight of f equals w(f)=?v?Vf(v). domination number ?dR(G) G minimum G. said be ?dR(G)=3?(G), where ?(G) We obtain sharp lower bound generalized Petersen graphs P(3k,k), we construct solutions providi...

2011
G. MAHADEVAN V. K. SHANTHI

A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. A Dominating set is said to be Fuzzy Double Dominating set if every vertex in V-S is adjacent to at least two vertices in S. The minimum cardinality taken over all, the minimal double dominating set is called Fuzzy Double Domination Number and is denoted by γ fdd (G). The minimum numb...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید