Constructing solvable groups whose character degree graphs generalize the bowtie

Abstract

We present here a generalized construction of a finite solvable group whose prime character degree graph has the shape and structure of the bowtie graph. As with the original bowtie, the graphs obtained by this generalized construction, under certain restrictions, cannot be realized by the usual method of taking direct products of smaller graphs. Within the condition of $n=1$, we show how this recovers the original bowtie graph, which has five vertices. We also provide examples and explicit choices of primes which generate graphs with more vertices.