Quasirecognition by the prime graph of the group Cn(2)
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
If G is a finite group, we denote by ?(G) the set of all prime divisors of |G| and by ?(G) the spectrum of G; i.e., the set of element orders of G. The prime graph (or Gruenberg-Kegel graph) ?(G) of G is the graph with vertex set ?(G) where two distinct vertices p and q are adjacent by an edge (we write (p, q) ? ?(G)) if p.q ? ?(G). A finite simple nonabelian group P is called quasirecognizable by its prime graph, if each finite group G with ?(G) = ?(P ) has a unique nonabelian composition factor isomorphic to P . In this paper, we show that the simple group Cn(2), where n is an odd number and n ? 9, is quasirecognizable by its prime graph.
Açıklama
Anahtar Kelimeler
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Ghasemabadi, M. F. ve Iranmanesh, A. (2009). Quasirecognition by the prime graph of the group Cn(2). Maltepe Üniversitesi. s. 240.
