On the character degree graph of finite groups

DOI10.1007/S10231-019-00833-0MaRDI QIDQ6307377arXivWikidataFDO

Authors Z. Akhlaghi, Carlo Casolo, Silvio Dolfi, Emanuele Pacifici, Lucia Sanus

Publication date 27 September 2018

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G), two distinct vertices p and q being adjacent if and only if pq divides some number in cd(G). In this paper, we consider the complement of the character degree graph, and we characterize the finite groups for which this complement graph is not bipartite. This extends the analysis of [1], where the solvable case was treated.

This page was built for publication: On the character degree graph of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6307377)