✦ LIBER ✦

Recognition of the groupsL5(4) andU4(4) by the prime graph

✍ Scribed by P. Nosratpour, M. R. Darafsheh

Book ID: 118811647
Publisher: Springer
Year: 2012
Tongue: English
Weight: 228 KB
Volume: 64
Category: Article
ISSN: 0041-5995
DOI: 10.1007/s11253-012-0641-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognition by noncommuting graph of fin

Recognition by noncommuting graph of finite simple groupsL4(q)

✍ M. Akbari; M. Kheirabadi; A. R. Moghaddamfar 📂 Article 📅 2010 🏛 Higher Education Press and Springer 🌐 English ⚖ 202 KB

Recognizability of finite simple groupsL

Recognizability of finite simple groupsL4(2m) andU4(2m) by spectrum

✍ V. D. Mazurov; G. Y. Chen 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 381 KB

Quasirecognition by prime graph of the s

Quasirecognition by prime graph of the simple group2F4(q)

✍ Z. Akhlaghi; M. Khatami; B. Khosravi 📂 Article 📅 2009 🏛 Akadmiai Kiad 🌐 English ⚖ 789 KB

Recognition of finite groups by the prim

Recognition of finite groups by the prime graph

✍ A. V. Zavarnitsine 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 219 KB

The 4-Choosability of Plane Graphs witho

The 4-Choosability of Plane Graphs without 4-Cycles

✍ Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosa

n-RECOGNITION BY PRIME GRAPH OF THE SIMP

n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)

✍ KHOSRAVI, BEHROOZ 📂 Article 📅 2008 🏛 World Scientific Publishing Company 🌐 English ⚖ 266 KB