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

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

Journal: :communication in combinatorics and optimization 0
nasrin dehgardi sirjan university of technology, sirjan 78137, iran lutz volkmann lehrstuhl ii fur mathematik, rwth aachen university, 52056 aachen, germany

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 conditions‎‎that (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each‎‎$vin v(d)$‎, ‎where $n^{-}(v)$ consists of all vertices of $d$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

2016
A. BEHTOEI E. VATANDOOST

In this work, we study the signed Roman domination number of the join of graphs. Specially, we determine it for the join of cycles, wheels, fans, and friendship graphs.

Journal: :Discussiones Mathematicae Graph Theory 2016
S. M. Hosseini Moghaddam Doost Ali Mojdeh Babak Samadi Lutz Volkmann

In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥ 2. Applying the concept of total limited packing we bound the signed total domination number of G with δ(G) ≥ 3 from above by n−2b 2ρo(G)+δ−3...

Journal: :Discrete Mathematics 2009
Saieed Akbari Sadegh Bolouki Pooya Hatami Milad Siami

Let γ ′ s (G) be the signed edge domination number of G. In 2006, Xu conjectured that: for any 2-connected graph G of order n(n ≥ 2), γ ′ s (G) ≥ 1. In this article we show that this conjecture is not true. More precisely, we show that for any positive integer m, there exists an m-connected graph G such that γ ′ s (G) ≤ − m 6 |V (G)|. Also for every two natural numbers m and n, we determine γ ′...

Journal: :transactions on combinatorics 2012
b basavanagoud sunilkumar m hosamani

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

2013
S. Akbari A. Norouzi - Fard A. Rezaei R. Rotabi S. Sabour

Let G be a graph with the vertex set V (G) and edge set E(G). A function f : E(G) → {−1,+1} is said to be a signed star dominating function ofG if ∑ e∈EG(v) f(e) ≥ 1, for every v ∈ V (G), where EG(v) = {uv ∈ E(G) |u ∈ V (G)}. The minimum of the values of ∑ e∈E(G) f(e), taken over all signed star dominating functions f on G is called the signed star domination number of G and is denoted by γss(G...

Journal: :Mathematica Bohemica 2004

Journal: :Discrete Mathematics 2004

Journal: :Acta Universitatis Sapientiae, Mathematica 2020

Journal: :Cogent Mathematics 2016

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

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