The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the Euclidean plane. The k-planar crossing number crk(G) of G is min{cr(G1) + cr(G2) + . . .+ cr(Gk)}, where the minimum is taken over all possible decompositions of G into k subgraphs G1, G2, . . . , Gk. The problem of computing the crossing number of complete graphs, cr(Kn), exactly for sm...

Progress in the theoretical description of B-meson decays, in particular decays to light hadrons, is reviewed. The factorization properties of such decays can be analyzed using the softcollinear effective theory. Applications of the effective theory to both inclusive and exclusive decays are discussed. FERMILAB-CONF-04-309-T hep-ph/0411065

in this paper we will prove that the simple group g2(q) where 2 < q = 1(mod3)is recognizable by the set of its order components, also other word we prove that if g is anite group with oc(g) = oc(g2(q)), then g is isomorphic to g2(q).

in this paper we will prove that the simple group g2(q) where 2 < q = 1(mod3)is recognizable by the set of its order components, also other word we prove that if g is anite group with oc(g) = oc(g2(q)), then g is isomorphic to g2(q).

The main aim of this study was to obtain the Crimean-Congo hemorrhagic fever virus (CCHFV) glycoprotein, through either stable transgenic plants or using a transient expression system, and determine the yield, quality and finally the immunogenicity of the plant-made CCHFV glycoprotein in a mouse model. We designed and synthesized a codon-optimized G1/G2 gene from the G1 and G2 parts of the CCHF...

For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.

Let G be a graph with given red-blue coloring c of the edges G. An ascending Ramsey sequence in respect to is G1, G2, …, Gk pairwise edge-disjoint subgraphs such that each subgraph Gi (1≤i≤k) monochromatic and isomorphic proper Gi+1 (1≤i≤k−1). The index ARc(G) maximum length an c. AR(G) minimum value among all colorings It shown there connection between this concept set partitions. investigated...

The minimum diameter method of morphometry (MDM) is used to measure and detect changes in myofibre diameters (FD). The MDM is used to identify pathology in skeletal muscle. In such studies, an assumption is made that the mean FD in a particular muscle in both limbs is essentially the same. This study explored this premise to determine the accuracy of MDM as a means of morphometric analysis. Mus...