QUASIRECOGNITION BY PRIME GRAPH OF U3(Q) WHERE WHERE 2 < Q= Pα<100

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SALEHI AMIRI SEYED SADEGH; KHALILI ASBOEI ALIREZA; IRANMANESH ALI; TEHRANIAN ABOLFAZL

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF GROUP THEORY Year:2012 | Volume:1 | Issue:3 Page(s): 51-66

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

662

Download:

123

Cites:

Information Journal Paper

Title

QUASIRECOGNITION BY PRIME GRAPH OF U3(Q) WHERE WHERE 2 < Q= Pα<100

Author(s)

SALEHI AMIRI SEYED SADEGH | KHALILI ASBOEI ALIREZA | IRANMANESH ALI | TEHRANIAN ABOLFAZL | Issue Writer Certificate

Keywords

PRIME GRAPHQ4

ELEMENT ORDERQ4

SIMPLE GROUPQ4

LINEAR GROUPQ4

Abstract

Let G be a nite group and let G(G) be the PRIME GRAPH of G. Assume 2<q=pa< 100.We determine finite groups G such that G (G) =G (U3 (q)) and prove that if q¹3; 5; 9; 17, then U3 (q) is quasirecognizable by PRIME GRAPH, i.e. if G is a finite group with the same PRIME GRAPH as the finite SIMPLE GROUP U3 (q), then G has a unique non-Abelian composition factor isomorphic to U3 (q). As a consequence of our results, we prove that the SIMPLE GROUPs U3 (8) and U3 (11) are 4-recognizable and 2-recognizable by PRIME GRAPH, respectively. In fact, the group U3 (8) is the rst example which is a 4-recognizable by PRIME GRAPH.

Cites

No record.

References

No record.

Cite

APA: Copy

SALEHI AMIRI, SEYED SADEGH, TEHRANIAN, ABOLFAZL, KHALILI ASBOEI, ALIREZA, & IRANMANESH, ALI. (2012). QUASIRECOGNITION BY PRIME GRAPH OF U_3(Q) WHERE WHERE 2 < Q= P^α<100. INTERNATIONAL JOURNAL OF GROUP THEORY, 1(3), 51-66. SID. https://sid.ir/paper/212666/en

Vancouver: Copy

SALEHI AMIRI SEYED SADEGH, TEHRANIAN ABOLFAZL, KHALILI ASBOEI ALIREZA, IRANMANESH ALI. QUASIRECOGNITION BY PRIME GRAPH OF U_3(Q) WHERE WHERE 2 < Q= P^α<100. INTERNATIONAL JOURNAL OF GROUP THEORY[Internet]. 2012;1(3):51-66. Available from: https://sid.ir/paper/212666/en

IEEE: Copy

SEYED SADEGH SALEHI AMIRI, ABOLFAZL TEHRANIAN, ALIREZA KHALILI ASBOEI, and ALI IRANMANESH, “QUASIRECOGNITION BY PRIME GRAPH OF U_3(Q) WHERE WHERE 2 < Q= P^α<100,” INTERNATIONAL JOURNAL OF GROUP THEORY, vol. 1, no. 3, pp. 51–66, 2012, [Online]. Available: https://sid.ir/paper/212666/en

Related Journal Papers