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

Abstract

Let [Formula: see text] be a finite group and [Formula: see text] be the set of nonlinear irreducible character degrees of [Formula: see text]. Suppose that [Formula: see text] is the set of primes dividing some elements of [Formula: see text]. The bipartite divisor graph for [Formula: see text], [Formula: see text], is a graph whose vertices are the disjoint union of [Formula: see text] and [Formula: see text], and a vertex [Formula: see text] is connected to a vertex [Formula: see text] if and only if [Formula: see text]. 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.