Quasirecognition by prime graph of $C_{n}(4) $, where $ n\geq17 $ is odd

Authors

  • Somayeh Mosavi Sahrekord University Faculty of Mathematical Sciences Department of pure Mathematics
  • Neda Ahanjideh Sahrekord University Faculty of Mathematical Sciences Department of pure Mathematics

DOI:

https://doi.org/10.5269/bspm.v33i1.21969

Keywords:

Quasirecognition, prime graph, simple group, element order

Abstract

Let $G$ be a finite group and let $\Gamma(G) $ be the prime graph of $ G$. We assume that $ n\geq 17$ is an odd number. In this paper, we show that if $ \Gamma(G) = \Gamma(C_{n}(4))$, then $ G$ has a unique non-abelian composition factor isomorphic to $C_{n}(4)$. As consequences of our result, $C_{n}(4)$ is quasirecognizable by its spectrum and by prime graph.

Author Biographies

  • Somayeh Mosavi, Sahrekord University Faculty of Mathematical Sciences Department of pure Mathematics
    Student in Department of pure Mathematics, Faculty of Mathematical Sciences
  • Neda Ahanjideh, Sahrekord University Faculty of Mathematical Sciences Department of pure Mathematics
    Assistant Prof. in Department of pure Mathematics, Faculty of Mathematical Sciences,

Downloads

Published

2014-02-03

Issue

Section

Research Articles