نتایج جستجو برای: singed graph
تعداد نتایج: 198062 فیلتر نتایج به سال:
The study was conducted to determine the influence of different processing methods; scalding and singeing on cowhide. Forty (40) pieces each white scaled Ponmo black singed were pulled together randomly subjected for proximate evaluation, organoleptic properties determination mineral contents determination. Analysis variance used analyze result in a complete randomize design using Duncan Multip...
This paper introduces the important concept of signature revocation. An important property of digital signature is nonrepudiatability that a signer can’t deny his legal signature. However, in some occasion a signer wants to take back his previously singed signature in a proper legal way, so that after certain interaction a signature can be regarded as invalidate. We originate a new study of ins...
The distribution of zakat fitrah coincides on the 30th Ramadhan Hijriyah as in Kedunggede Village. There are prolems process distribution, results reports from each hamlet must be known and singed by committee chairman village administration then determine nominal money weight rice distributed. solution offered is to implement an application that has been made adjusting needs partners, with E-Z...
The mutation rates of specific loci and chromosome regions were estimated for two types of dysgenic hybrid males. These came from crosses between P or Q males and M females in the P-M system of hybrid dysgenesis. The M X P hybrids were the more mutable for each of the loci and chromosome regions tested. The Beadex locus was highly mutable in these hybrids but did not mutate at all in the sample...
let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...
let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and $e_{n,m}$ be the graph obtained from a path $p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of $k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$, and by joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$ to $v_{d_{n,m}-2}$. zhang, liu and zhou [on the maximal eccentric connectivity ind...
the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this graph. also we give a relation between the order graph and prime graph of a group.
let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید