z-logo
open-access-imgOpen Access
Quasirecognition by prime graph of $C_{n}(4) $, where $ n\geq17 $ is odd
Author(s) -
Somayeh Mosavi,
Neda Ahanjideh
Publication year - 2014
Publication title -
boletim da sociedade paranaense de matemática
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.347
H-Index - 15
eISSN - 2175-1188
pISSN - 0037-8712
DOI - 10.5269/bspm.v33i1.21969
Subject(s) - combinatorics , prime (order theory) , mathematics , graph , abelian group , discrete mathematics
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here