Quasirecognition by the prime graph of the group Cn(2)

Basit Öğe Kaydı
dc.contributor.authorGhasemabadi, M. Foroudi
dc.contributor.authorIranmanesh, Ali
dc.date.accessioned2024-07-12T20:50:05Z
dc.date.available2024-07-12T20:50:05Z
dc.date.issued2009en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractIf 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.en_US
dc.identifier.citationGhasemabadi, M. F. ve Iranmanesh, A. (2009). Quasirecognition by the prime graph of the group Cn(2). Maltepe Üniversitesi. s. 240.en_US
dc.identifier.endpage241en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage240en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2278
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07605
dc.titleQuasirecognition by the prime graph of the group Cn(2)en_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu