Quasirecognition by prime graph of .
In this paper as the main result, we determine finite groups with the same prime graph as the automorphism group of a sporadic simple group, except .
There exist many results about the Diophantine equation , where and . In this paper, we suppose that , is an odd integer and a power of a prime number. Also let be an integer such that the number of prime divisors of is less than or equal to . Then we solve completely the Diophantine equation for infinitely many values of . This result finds frequent applications in the theory of finite groups.
The order of every finite group can be expressed as a product of coprime positive integers such that is a connected component of the prime graph of . The integers are called the order components of . Some non-abelian simple groups are known to be uniquely determined by their order components. As the main result of this paper, we show that the projective symplectic groups where are also uniquely determined by their order components. As corollaries of this result, the validities of a...
Let be a finite group. The prime graph of is a graph whose vertex set is the set of prime divisors of and two distinct primes and are joined by an edge, whenever contains an element of order . The prime graph of is denoted by . It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if is a finite group such that , where , then has a unique nonabelian composition factor isomorphic to or .
The character degree graph of a finite group is the graph whose vertices are the prime divisors of the irreducible character degrees of and two vertices and are joined by an edge if divides some irreducible character degree of . It is proved that some simple groups are uniquely determined by their orders and their character degree graphs. But since the character degree graphs of the characteristically simple groups are complete, there are very narrow class of characteristically simple...
For a finite group , the intersection graph of which is denoted by is an undirected graph such that its vertices are all nontrivial proper subgroups of and two distinct vertices and are adjacent when . In this paper we classify all finite groups whose intersection graphs are regular. Also, we find some results on the intersection graphs of simple groups and finally we study the structure of .
For a finite group , , the intersection graph of , is a simple graph whose vertices are all nontrivial proper subgroups of and two distinct vertices and are adjacent when . In this paper, we classify all finite nonsimple groups whose intersection graphs have a leaf and also we discuss the characterizability of them using their intersection graphs.
Let be a finite group and a prime number. We prove that if is a finite group of order such that has an irreducible character of degree and we know that has no irreducible character such that , then is isomorphic to . As a consequence of our result we prove that is uniquely determined by the structure of its complex group algebra.
Page 1