title: A characterization of L 3(4) by its character degree graph and order.
abstract: 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.
authors.affiliation: School of Science, Sichuan University of Science and Engineering, Xueyuan Street, Zigong, 643000 Sichuan People's Republic of China.
authors.forename: Shitian
authors.initials: S
authors.lastname: Liu
authors.affiliation: School of Science, Sichuan University of Science and Engineering, Xueyuan Street, Zigong, 643000 Sichuan People's Republic of China.
authors.forename: Yunxia
authors.initials: Y
authors.lastname: Xie
keywords: Character degree; Character degree graph; Projective special linear group; Simple group