نتایج جستجو برای: حسگر a d v
تعداد نتایج: 13611167 فیلتر نتایج به سال:
فرض کنید g گرافی با مجموعه رئوس v باشد. زیرمجموعه d از v یک مجموعه احاطه گر است هرگاه هر راس از v-d با راسی از d مجاور باشد. افراز دماتیک رئوس عبارت است از افراز رئوس به مجموعه های احاطه گر. بیشترین تعداد مجموعه در چنین افرازی، عدد دماتیک g نامیده میشود. فرض گنید f تابعی باشد که به رئوس گراف مقادیر 0، 1 و 2 را نسبت می دهد. هرگاه هر راس با مقدار 0 با راسی با مقدار 2 مجاور باشد، به چنین تابعی تا...
chapter one is devotod to collect some notion and background informations, which are needed in the next chapters. it also contains some important statements which will be proved in a more general context later in this thesis. in chapter two, we show that if the marginal factor-group is of order np1...pk,n>1, then we obtain a bound for the order of the verbal subgroup. also a bound for the bear-...
Let $R$ be a ring, and let $n, d$ be non-negative integers. A right $R$-module $M$ is called $(n, d)$-projective if $Ext^{d+1}_R(M, A)=0$ for every $n$-copresented right $R$-module $A$. $R$ is called right $n$-cocoherent if every $n$-copresented right $R$-module is $(n+1)$-coprese-nted, it is called a right co-$(n,d)$-ring if every right $R$-module is $(n, d)$-projective. $R$...
let g be a simple graph. the hosoya polynomial of g is ( , ) ,( , ) = { , } ( ) xd u v h g x u v v gwhere d(u,v) denotes the distance between vertices u and v . the dendrimer nanostar is apart of a new group of macromolecules. in this paper we compute the hosoya polynomial foran infinite family of dendrimer nanostar. as a consequence we obtain the wiener index andthe hyper-wiener index of th...
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...
The first variable Zagreb index of graph $G$ is defined as begin{eqnarray*} M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}, end{eqnarray*} where $lambda$ is a real number and $d(v)$ is the degree of vertex $v$. In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...
let $r$ be a ring, and let $n, d$ be non-negative integers. a right $r$-module $m$ is called $(n, d)$-projective if $ext^{d+1}_r(m, a)=0$ for every $n$-copresented right $r$-module $a$. $r$ is called right $n$-cocoherent if every $n$-copresented right $r$-module is $(n+1)$-coprese-nted, it is called a right co-$(n,d)$-ring if every right $r$-module is $(n, d)$-projective. $r$ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید