About noncommuting graphs.
Let be a finite group and let be the set of prime divisors of for which . The Gruenberg-Kegel graph of , denoted , is defined as follows: its vertex set is and two different vertices and are adjacent by an edge if and only if contains an element of order . The degree of a vertex in is denoted by and the -tuple is said to be the degree pattern of . Moreover, if is the vertex set of a connected component of , then the largest -number which divides , is said to be an...
In this paper, we first find the set of orders of all elements in some special linear groups over the binary field. Then, we will prove the characterizability of the special linear group using only the set of its element orders.
Page 1