نتایج جستجو برای: total Roman domination subdivision

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

Journal: :transactions on combinatorics 2013
jafar amjadi hossein karami seyed mahmoud sheikholeslami lutz volkmann

a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {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$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

2012
Abdollah Khodkar

A Roman dominating function of a graph G is a labeling f : V (G) −→ {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ v∈V (G) f(v) over such functions. The Roman domination subdivision number sdγR(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order t...

2013
J. AMJADI H. KARAMI S. M. SHEIKHOLESLAMI Hamid Reza Maimani J. Amjadi H. Karami S. M. Sheikholeslami

A Roman dominating function on a graph G = (V,E) is a function f : V −→ {0, 1, 2} satisfying the condition that every vertex v for which f(v) = 0 is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function is the value w(f) = ∑ v∈V f(v). The Roman domination number of a graph G, denoted by γR(G), equals the minimum weight of a Roman dominating function on ...

Journal: :bulletin of the iranian mathematical society 0
h. hosseinzadeh department of mathematics‎, ‎alzahra university‎, ‎p.o. box 19834, tehran‎, ‎iran. n. soltankhah department of mathematics‎, ‎alzahra university‎, ‎p.o. box 19834, tehran‎, ‎iran.

‎let $g=(v(g),e(g))$ be a graph‎, ‎$gamma_t(g)$. let $ooir(g)$ be the total domination and oo-irredundance number of $g$‎, ‎respectively‎. ‎a total dominating set $s$ of $g$ is called a $textit{total perfect code}$ if every vertex in $v(g)$ is adjacent to exactly one vertex of $s$‎. ‎in this paper‎, ‎we show that if $g$ has a total perfect code‎, ‎then $gamma_t(g)=ooir(g)$‎. ‎as a consequence, ...

Journal: :Australasian J. Combinatorics 2007
Odile Favaron Hosein Karami Seyed Mahmoud Sheikholeslami

Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{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 vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...

‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N(v)}f(x)ge 0$ for each‎ ‎$vin V(G)$‎, ‎where $N(v)$ is the open neighborhood of $v$‎, ‎and (ii) every vertex $u$ for which‎ ‎$f(u...

Journal: :Discussiones Mathematicae Graph Theory 2004
Teresa W. Haynes Michael A. Henning Lora Hopkins

A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. The total domination subdivision number of G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the tot...

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

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