نتایج جستجو برای: signed graphs

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

Journal: :European Journal of Combinatorics 2016

Journal: :Optimization Letters 2015

‎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: :European Journal of Combinatorics 1987

Journal: :Cogent Mathematics 2016

Journal: :Discrete Mathematics 1993

Journal: :Discrete Mathematics 2002

Journal: :The Electronic Journal of Linear Algebra 2021

Journal: :Discrete Mathematics 1996

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

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