Groups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
author
Abstract:
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is connected to a vertex $a in cd^*(G)$ if and only if $p|a$. In this paper, we investigate the structure of a group $G$ whose graph $B(G)$ has five vertices. Especially we show that all these groups are solvable.
similar resources
on bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
full texton bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
full textOn Bipartite Divisor Graph for Character Degrees
The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95–105.]. In this paper, we will consider this graph for the set of character degrees of a finite group G and obtain some properties of this graph. We show that if G is a solvable group, then the number...
full textAFFINE SUBGROUPS OF THE CLASSICAL GROUPS AND THEIR CHARACTER DEGREES
In this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. In [4] Gow obtained certain character degrees for all of the affine subgroups of the classical groups. We apply the method of Fischer to the above groups and, in addition to the character degrees given in [4], we obtain some ne...
full textNonsolvable Groups All of Whose Character Degrees Are Odd-Square-Free
A finite group G is odd-square-free if no irreducible complex character of G has degree divisible by the square of an odd prime. We determine all odd-square-free groups G satisfying S 6 G 6 Aut(S) for a finite simple group S. More generally, we show that ifG is any nonsolvable odd-square-free group, then G has at most two nonabelian chief factors and these must be simple odd-square-free groups....
full textMy Resources
Journal title
volume 17 issue 1
pages 145- 151
publication date 2022-04
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023