## Currently displaying 1 – 14 of 14

Showing per page

Order by Relevance | Title | Year of publication

### On the prime graphs of the automorphism groups of sporadic simple groups

Archivum Mathematicum

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 ${J}_{2}$.

### On the Diophantine equation $\frac{{q}^{n}-1}{q-1}=y$

Commentationes Mathematicae Universitatis Carolinae

There exist many results about the Diophantine equation $\left({q}^{n}-1\right)/\left(q-1\right)={y}^{m}$, where $m\ge 2$ and $n\ge 3$. In this paper, we suppose that $m=1$, $n$ is an odd integer and $q$ a power of a prime number. Also let $y$ be an integer such that the number of prime divisors of $y-1$ is less than or equal to $3$. Then we solve completely the Diophantine equation $\left({q}^{n}-1\right)/\left(q-1\right)=y$ for infinitely many values of $y$. This result finds frequent applications in the theory of finite groups.

### A characterization of ${C}_{2}\left(q\right)$ where $q>5$

Commentationes Mathematicae Universitatis Carolinae

The order of every finite group $G$ can be expressed as a product of coprime positive integers ${m}_{1},\cdots ,{m}_{t}$ such that $\pi \left({m}_{i}\right)$ is a connected component of the prime graph of $G$. The integers ${m}_{1},\cdots ,{m}_{t}$ are called the order components of $G$. 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 ${C}_{2}\left(q\right)$ where $q>5$ are also uniquely determined by their order components. As corollaries of this result, the validities of a...

### On the composition factors of a group with the same prime graph as ${B}_{n}\left(5\right)$

Czechoslovak Mathematical Journal

Let $G$ be a finite group. The prime graph of $G$ is a graph whose vertex set is the set of prime divisors of $|G|$ and two distinct primes $p$ and $q$ are joined by an edge, whenever $G$ contains an element of order $pq$. The prime graph of $G$ is denoted by $\Gamma \left(G\right)$. It is proved that some finite groups are uniquely determined by their prime graph. In this paper, we show that if $G$ is a finite group such that $\Gamma \left(G\right)=\Gamma \left({B}_{n}\left(5\right)\right)$, where $n\ge 6$, then $G$ has a unique nonabelian composition factor isomorphic to ${B}_{n}\left(5\right)$ or ${C}_{n}\left(5\right)$.

### Recognition of characteristically simple group ${A}_{5}×{A}_{5}$ by character degree graph and order

Czechoslovak Mathematical Journal

The character degree graph of a finite group $G$ is the graph whose vertices are the prime divisors of the irreducible character degrees of $G$ and two vertices $p$ and $q$ are joined by an edge if $pq$ divides some irreducible character degree of $G$. 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...

### On the intersection graph of a finite group

Czechoslovak Mathematical Journal

For a finite group $G$, the intersection graph of $G$ which is denoted by $\Gamma \left(G\right)$ is an undirected graph such that its vertices are all nontrivial proper subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent when $H\cap K\ne 1$. 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 $\mathrm{Aut}\left(\Gamma \left(G\right)\right)$.

### Characterization by intersection graph of some families of finite nonsimple groups

Czechoslovak Mathematical Journal

For a finite group $G$, $\Gamma \left(G\right)$, the intersection graph of $G$, is a simple graph whose vertices are all nontrivial proper subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent when $H\cap K\ne 1$. 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.

### Quasirecognition by prime graph of ${L}_{10}\left(2\right)$.

Sibirskij Matematicheskij Zhurnal

### Groups with the same prime graph as an almost sporadic simple group.

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

### A new characterization for the simple group $\mathrm{PSL}\left(2,{p}^{2}\right)$ by order and some character degrees

Czechoslovak Mathematical Journal

Let $G$ be a finite group and $p$ a prime number. We prove that if $G$ is a finite group of order $|\mathrm{PSL}\left(2,{p}^{2}\right)|$ such that $G$ has an irreducible character of degree ${p}^{2}$ and we know that $G$ has no irreducible character $\theta$ such that $2p\mid \theta \left(1\right)$, then $G$ is isomorphic to $\mathrm{PSL}\left(2,{p}^{2}\right)$. As a consequence of our result we prove that $\mathrm{PSL}\left(2,{p}^{2}\right)$ is uniquely determined by the structure of its complex group algebra.

### A new characterization of some alternating and symmetric groups.

International Journal of Mathematics and Mathematical Sciences

### Groups with the same orders of Sylow normalizers as the Mathieu groups.

International Journal of Mathematics and Mathematical Sciences

### 2-recognizability by prime graph of $\text{PSL}\left(2,{p}^{2}\right)$.

Sibirskij Matematicheskij Zhurnal

### Quasirecognition by prime graph of the simple group ${}^{2}{G}_{2}\left(q\right)$.

Sibirskij Matematicheskij Zhurnal

Page 1