M. Bibak
Department of Mathematics, Payame Noor University, Iran.
[ 1 ] - Characterization of some projective special linear groups in dimension four by their orders and degree patterns
Let $G$ be a finite group. The degree pattern of $G$ denoted by $D(G)$ is defined as follows: If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that $p_{1}
[ 2 ] - Characterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
[ 3 ] - OD-Characterization of almost simple groups related to $L_{3}(25)$
Let $G$ be a finite group and $pi(G)$ be the set of all the prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct vertices $p$ and $q$ are joined by an edge if and only if $G$ has an element of order $pq$, and in this case we will write $psim q$. The degree of $p$ is the number of vertices adjacent to $p$ and is ...
[ 4 ] - OD-characterization of Almost Simple Groups Related to displaystyle D4(4)
Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...
Co-Authors