Related papers: On Recognition by Order and Degree Pattern of Fini…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…

The prime coprime graph $\Theta(G)$ of a finite group $G$ is the graph whose vertex set is $G$ and any two distinct vertices are adjacent if the greatest common divisor of their orders is either $1$ or a prime. In this paper, we investigate…

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Let $G$ be a finite group and $\chi\in \irr(G)$. The codegree of $\chi$ is defined as $\cod(\chi)=\frac{|G:\ker(\chi)|}{\chi(1)}$ and $\cod(G)=\{\cod(\chi) \ |\ \chi\in \irr(G)\}$ is called the set of codegrees of $G$. In this paper, we…

Motivated by the Problem $164$ proposed by Y. Berkovich and E. Zhmud' in their book "Characters of finite groups, Part $1$", we give a characterization of finite groups whose irreducible character codegrees are prime powers. This is based…

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…

Let $G$ be a finite group and $cd(G)$ denote the set of complex irreducible character degrees of $G$. In this paper, we prove that if $G$ is a finite group and $H$ is an almost simple group whose socle is Mathieu group such that $cd(G)…

Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group $L$ is said to be almost recognizable by spectrum if every finite group isospectral to $L$ is an almost simple group…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

We continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to…

In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these…

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

The spectrum of a finite group is the set of its element orders, and two groups are said to be isospectral if they have the same spectra. A finite group $G$ is said to be recognizable by spectrum, if every finite group isospectral with $G$…

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…