Abstract
Given a finite group G , the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G\setminus\mathbf Z (G) (where \mathbf Z (G) denotes the centre of G ) and the set of prime numbers that divide these conjugacy class sizes, and with \{p,n\} being an edge if gcd (p,n)\neq 1 . In this paper we construct infinitely many groups whose bipartite divisor graph for their conjugacy class sizes is the complete bipartite graph K_{2,5} , giving a solution to a question of Taeri [15].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Rendiconti del Seminario Matematico della Università di Padova
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
