Related Experiment Video
Updated: Mar 23, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
A characterization of L 3(4) by its character degree graph and order
1School of Science, Sichuan University of Science and Engineering, Xueyuan Street, Zigong, 643000 Sichuan People's Republic of China.
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.
Related Concept Videos
Ladder Diagrams: Complexation Equilibria
The formation constant, K1, for the formation of Cd(NH3)2+ complex from cadmium and ammonia is 3.55 × 102. Log K1 (i.e. pNH3) is 2.55, and...
Introduction to Polynomial Functions
Bewley Lattice Diagram
Second Derivatives and the Shape of a Graph
Ladder Diagrams: Acid–Base Equilibria
A ladder diagram for acid-base equilibria consists of a vertical axis that represents pH and horizontal bars (steps on the ladder) that help position all the pKa values in the system. At equilibrium, the pH value of the system corresponds to one of...
Transfer function and Bode Plots-II

