نتایج جستجو برای: etvos number
تعداد نتایج: 1168336 فیلتر نتایج به سال:
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, ...
a {em 2-rainbow dominating function} (2rdf) of a graph $g$ is a function $f$ from the vertex set $v(g)$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin v(g)$ with $f(v)=emptyset$ the condition $bigcup_{uin n(v)}f(u)={1,2}$ is fulfilled, where $n(v)$ is the open neighborhood of $v$. the {em weight} of a 2rdf $f$ is the value $omega(f)=sum_{vin v}|f (v)|$. the {em $2$-r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید