‎let $g$ be a finite group which is not a cyclic $p$-group‎, ‎$p$ a prime number‎. ‎we define an undirected simple graph $delta(g)$ whose‎ ‎vertices are the proper subgroups of $g$, which are not contained in the‎ ‎frattini subgroup of $g$ and two vertices $h$ and $k$ are joined by an edge‎ ‎if and only if $g=langle h‎ , ‎krangle$‎. ‎in this paper we classify finite groups with planar graph‎. ‎...

One of the main aims of workers in the theory of groups has always been the determination of all finite simple groups. For simple groups may be regarded as the fundamental building blocks out of which finite groups are constructed. The cyclic groups of prime order are trivial examples of simple groups, and are the only simple groups which are Abelian. The first examples of non-Abelian simple gr...

 After the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. In this article, we present a partial classification of the finite linear spaces $mathcal S$ on which an almost simple group $G$ with the socle $G_2(q)$ acts line-transitively.

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

A group is small if it has countably many complete n-types over the empty set for each natural number n. More generally, a group G is weakly small if it has countably many complete 1-types over every finite subset of G. We show here that in a weakly small group, subgroups which are definable with parameters lying in a finitely generated algebraic closure satisfy the descending chain conditions ...

let $g$ be a finite group and let $gk(g)$ be the prime graph of $g$. we assume that $ngeqslant 5 $ is an odd number. in this paper, we show that the simple groups $b_n(3)$ and $c_n(3)$ are 2-recognizable by their prime graphs. as consequences of the result, the characterizability of the groups $b_n(3)$ and $c_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are obtai...

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...