Two distinct redistribution grids - adaptation techniques, spring analogy and elliptic grid generator are applied to two-dimensional steady, inviscid, shocked flows, and the ability of each technique is examined and compared. Euler equations are solved base on Roe's Reimann solver approach to simulate supersonic flow around a sphere, transonic flow about an airfoil and supersonic flow in a symm...

identification of quantitative trait loci is one of the important issues in breeding program especially under stress condition. plant material in the present study was a natural population including 72 tobacco genotypes. in order to apply osmotic stress, mannitol with 0.33 molar concentrations was used. the genotyping of individual were performed using 21 out of 35 primer combinations of aflp m...

We obtain an explicit formula for the variance of number $k$-peaks in a uniformly random permutation. This is then used to asymptotic length longest $k$-alternating subsequence permutations. Also central limit proved latter statistic.

total, regional and segmental growth rate of vertebral column were studied during the postnatal life of 30 male camels. these animals were into five groups of neonate, 1 y, 2.5-3y, 4-4.5y, 5.5-6y and 7-10 years divided. the results revealed that, although the growth rate was higher in younger animals than the older ones, but it was not constant in an regions and it was varied according to the a...

Two sharp lower bounds for the length of a longest cycle C of a graph G are presented in terms of the lengths of a longest path and a longest cycle of G − C, denoted by p and c, respectively, combined with minimum degree δ: (1) |C| ≥ (p + 2)(δ − p) and (2) |C| ≥ (c + 1)(δ − c + 1).

for a composition $lambda$ of $n$ our aim is to obtain reduced forms ‎for all the elements in the kazhdan-lusztig (right) cell containing ‎$w_{j(lambda)}$‎, ‎the longest element of the standard parabolic‎ ‎subgroup of $s_n$ corresponding to $lambda$‎. ‎we investigate how far this is possible to achieve by looking at‎ ‎elements of the form $w_{j(lambda)}d$‎, ‎where $d$ is a prefix of ‎an element...

Let G be a graph, and let p(G) and c(G) be the order of a longest path and a longest cycle of G, respectively. In [J. Graph Theory 30 (1999), 91– 99], Saito proved that if G is a 2-connected graph with p(G)− c(G) ≥ 2, then p(G) ≥ σ3(G) − 1. In this paper, we evaluate the length of a longest path of G by using σ4(G). Specifically, our main results are the following. (i) If G is a 3-connected gra...