Groups whose character degree graph has diameter three

preprint2016arXivOpen access

Abstract

Let GG be a finite group, and let Δ(G)Δ(G) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of GG. It is well known that, whenever Δ(G)Δ(G) is connected, the diameter of Δ(G)Δ(G) is at most 33. In the present paper, we provide a description of the finite solvable groups for which the diameter of this graph attains the upper bound. This also enables us to confirm a couple of conjectures proposed by M.L. Lewis.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.