Abstract
The Gruenberg-Kegel graph of a finite group is a simple graph with vertex set , the set of all primes dividing the order of , and such that two distinct vertices and are joined by an edge, , if contains an element of order . The degree of a vertex is the number of edges incident on . In the case when with , we consider the -tuple , which is called the degree pattern of . The group is called -fold OD-characterizable if there exist exactly non-isomorphic groups satisfying condition . Especially, a 1-fold OD-characterizable group is simply called OD-characterizable. In this paper, we first find the degree pattern of the projevtive special linear groups over binary field and among other results we prove that the simple groups and are OD-characterizable (Theorem \ref{10-11}). It is also shown that automorphism groups and , where is a Mersenne prime, are OD-characterizable (Theorem \ref{auto}).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.