In this paper we determine the structure of finite solvable groups with non-connected character degree graph and improve the related known results.MathematicsSCI(E)21ARTICLE94249-42582
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
A classical theorem on character degrees states that if a finite group has fewer than four character...
In this paper, we characterize the finite solvable groups with non-complete character degree graphs ...
AbstractLet Γ be a graph in which each vertex is non-adjacent to another different one. We show that...
This paper concerns the arithmetical structure of the character degrees of a finite group. A useful ...
summary:Let $m>1$ be a fixed positive integer. In this paper, we consider finite groups each of whos...
In this paper, we continue the classification work done in the first paper of the same name. With ca...
AbstractThe aim of this paper is to classify all the finite solvable groups G whose character graphs...
In this paper, we consider the degrees of the non-faithful irreducible characters of finite groups. ...
We present some variations on some of the main open problems on character degrees. We collect some o...
AbstractBerkovichet al.[Proc. Amer. Math. Soc.115(1992), 955–959] classified all groups in which the...
In the literature, there are several graphs related to a finite group G. Two of them are the charact...
AbstractThe aim of this paper is to investigate the finite solvable groups with at most two nonlinea...
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
A classical theorem on character degrees states that if a finite group has fewer than four character...
In this paper, we characterize the finite solvable groups with non-complete character degree graphs ...
AbstractLet Γ be a graph in which each vertex is non-adjacent to another different one. We show that...
This paper concerns the arithmetical structure of the character degrees of a finite group. A useful ...
summary:Let $m>1$ be a fixed positive integer. In this paper, we consider finite groups each of whos...
In this paper, we continue the classification work done in the first paper of the same name. With ca...
AbstractThe aim of this paper is to classify all the finite solvable groups G whose character graphs...
In this paper, we consider the degrees of the non-faithful irreducible characters of finite groups. ...
We present some variations on some of the main open problems on character degrees. We collect some o...
AbstractBerkovichet al.[Proc. Amer. Math. Soc.115(1992), 955–959] classified all groups in which the...
In the literature, there are several graphs related to a finite group G. Two of them are the charact...
AbstractThe aim of this paper is to investigate the finite solvable groups with at most two nonlinea...
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
summary:In the literature, there are several graphs related to a finite group $G$. Two of them are t...
DOI
Add to ORKG