Bipartite divisor graph for the set of irreducible character degrees

From MaRDI portal
(Redirected from Publication:5124029)



Abstract: Let G be a finite group. We consider the set of the irreducible complex characters of G, namely Irr(G), and the related degree set cd(G)=chi(1):chiinIrr(G). Let ho(G) be the set of all primes which divide some character degree of G. In this paper we introduce the bipartite divisor graph for cd(G) as an undirected bipartite graph with vertex set ho(G)cup(cd(G)setminus1), such that an element p of ho(G) is adjacent to an element m of cd(G)setminus1 if and only if p divides m. We denote this graph simply by B(G). Then by means of combinatorial properties of this graph, we discuss the structure of the group G. In particular, we consider the cases where B(G) is a path or a cycle.












This page was built for publication: Bipartite divisor graph for the set of irreducible character degrees

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