Related papers: Non-solvable groups whose character degree graph h…

Berkovich, Chillag and Herzog characterized all finite groups $G$ in which all the nonlinear irreducible characters of $G$ have distinct degrees. In this paper we extend this result showing that a similar characterization holds for all…

There has been some interest on how the average character degree affects the structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, the average number of zeros of characters of a finite group $ G $ as the number of zeros…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

We classify the finite groups $G$ which satisfies the condition that every complex irreducible character,whose degree's square doesn't divide the index of its kernel in $G$, lies in the same Galois conjugacy class.

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group $G$ is a simple undirected graph whose vertex…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

For an irreducible character $\chi$ of a finite group $G$, the codegree of $\chi$ is defined as $|G:\ker(\chi)|/\chi(1)$. In this paper, we determine finite nonsolvable groups with exactly three nonlinear irreducible character codegrees,…

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

Given a graph $G$ and a non trivial partition $(V_1,V_2)$ of its vertex-set, the satisfaction of a vertex $v\in V_i$ is the ratio between the size of it's closed neighborhood in $V_i$ and the size of its closed neighborhood in $G$. The…

In this paper we consider finite groups G satisfying the following condition: G has two columns in its character table which differ by exactly one entry. It turns out that such groups exist and they are exactly the finite groups with a…

A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

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…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

Let $G$ be a finite group and ${\rm 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 with socle $H_{0}= \, ^{2}{\rm G}_{2}(q)$,…

We consider groups where the centers of the irreducible characters form a chain. We obtain two alternate characterizations of these groups, and we obtain some information regarding the structure of these groups. Using our results, we are…