{'fraction_non_alphanumeric': 0.05143721633888049, 'fraction_numerical': 0.018154311649016642, 'mean_word_length': 4.21259842519685, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Prime Graph of a Sporadic Simple Group

Abstract Let Gbe a finite group and Sa sporadic simple group. We denote by π(G) the set of all primes dividing the order of G. The prime graph Γ(G) of Gis defined in the usual way connecting pand qin π(G) when there is an element of order pqin G. The main purpose of this paper is to determine finite group Gsatisfying Γ(G) = Γ(S) (See Theorem 3) and to give applications which generalize Abe (Abe, S. Two ways to characterize 26 sporadic finite simple groups. Preprint) and Chen (Chen, G. (1996). A new characterization of sporadic simple groups. Algebra Colloq.3:49–58). The results are elementary but quite useful.