WorksMathematics
On primes not adjacent to in the prime graphs of almost simple groups
Abstract
The prime graph of a finite group is the graph whose vertices are primes dividing the order of and in which two distinct primes and are adjacent if and only if has an element of order . The -independence number of is the maximal size of independent vertex subsets in containing the vertex~. We determine all almost simple groups whose prime graph has a vertex not adjacent to and find the -independence numbers of all almost simple groups.