Translator Disclaimer
December 2020 An overview on the bipartite divisor graph for the set of irreducible character degrees
Roghayeh Hafezieh, Pablo Spiga
Rocky Mountain J. Math. 50(6): 2073-2095 (December 2020). DOI: 10.1216/rmj.2020.50.2073


Let G be a finite group. The bipartite divisor graph B(G) for the set of irreducible complex character degrees cd(G) is the undirected graph with vertex set consisting of the prime numbers dividing some element of cd(G) and of the nonidentity character degrees in cd(G), where a prime number p is declared to be adjacent to a character degree m if and only if p divides m. The graph B(G) is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees.

The scope of this paper is two-fold. We draw some attention to B(G) by outlining the main results that have been proved so far, see for instance [10; 11; 25; 26; 27]. In this process we improve some of these results.


Download Citation

Roghayeh Hafezieh. Pablo Spiga. "An overview on the bipartite divisor graph for the set of irreducible character degrees." Rocky Mountain J. Math. 50 (6) 2073 - 2095, December 2020.


Received: 26 June 2019; Accepted: 12 January 2020; Published: December 2020
First available in Project Euclid: 5 January 2021

Digital Object Identifier: 10.1216/rmj.2020.50.2073

Primary: 05C25
Secondary: 05C75

Rights: Copyright © 2020 Rocky Mountain Mathematics Consortium


This article is only available to subscribers.
It is not available for individual sale.

Vol.50 • No. 6 • December 2020
Back to Top