Search
نمایش تعداد 1-10 از 497
A contrastive analysis of the present progressive in French and English
Desingularization by blowings-up avoiding simple normal crossings
ON SIMPLE Kn–GROUPS FOR n = 5, 6
A finite nonabelian simple group is called a simple Kn–group, if the order of G has
exactly n distinct prime factors. M. Herzog and W.J. Shi gave a characterization
of simple Kn–group for n = 3, 4, respectively. In this paper, we...
The Commuting Graph of Finite Groups
The commuting graph of a group G, denoted by \\\\\\\\Gamma(G), is a simple graph whose vertices are all non-central elements of G and two distinct vertices x,y are adjacent if xy=yx....
Conjugate Graphs of Finite Groups
nonabelian simple group which
satisfy Thompson’s conjecture, then G ∼ S. Further, if central factors of two nonabelian
groups H and G are isomorphic and |Z(G)| = |Z(H)|, then H and G have isomorphic
conjugate graphs....
Mixed Convective Slip Flows in a Vertical parallel-plate Plate Microchannel With Symmetric and Asymmetric Wall Heat Fluxes
the SIMPLE algorithm. The velocity and temperature fields are examined for different values of Knudsen number, mixed convection parameter and heat flux ratio. It is found that in- creasing Gr/Re leads to an increase in the heat transfer rate and friction...