Volume 10, Issue 1 (4-2015)                   IJMSI 2015, 10(1): 23-43 | Back to browse issues page


XML Print


Abstract:  
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 on $p$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$ with $p_{1}
Type of Study: Research paper | Subject: Special