Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Groups whose bipartite divisor graph for character degrees has four or fewer vertices

    https://doi.org/10.1142/S1793557120500394Cited by:1 (Source: Crossref)

    Let G be a finite group and cd(G) be the set of nonlinear irreducible character degrees of G. Suppose that ρ(G) is the set of primes dividing some elements of cd(G). The bipartite divisor graph for cd(G), B(G), is a graph whose vertices are the disjoint union of ρ(G) and cd(G), and a vertex pρ(G) is connected to a vertex acd(G) if and only if p|a. In this paper, we consider groups whose graph has four or fewer vertices. We show that all these groups are solvable and determine the structure of these groups. We also provide examples of any possible graph.

    Communicated by A. F. Vasil’ev

    AMSC: 20C15, 20D60