A characterization of L(3)(4) by its character degree graph and order

Let G be a finite group. The character degree graph [Formula: see text] of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides the character degree of G. Let [Formula: see text] be the projective special linear g...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Shitian, Xie, Yunxia
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4771690/
https://www.ncbi.nlm.nih.gov/pubmed/27026936
http://dx.doi.org/10.1186/s40064-016-1785-5
Descripción
Sumario:Let G be a finite group. The character degree graph [Formula: see text] of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides the character degree of G. Let [Formula: see text] be the projective special linear group of degree n over a finite field of order q. Khosravi et. al. have shown that the simple groups [Formula: see text] , and [Formula: see text] where [Formula: see text] are characterizable by the degree graphs and their orders. In this paper, we give a characterization of [Formula: see text] by using the character degree graph and its order.

Ejemplares similares