Recognition of some linear groups over the binary field by the spectrum.
The prime graph of a finite group is defined as follows: the set of vertices is , the set of primes dividing the order of , and two vertices , are joined by an edge (we write ) if and only if there exists an element in of order . We study the groups such that the prime graph is a tree, proving that, in this case, .
Page 1