Abstract
The character degree graph of a finite group G is the graph whose vertices are the prime divisors of the irreducible character degrees of G and two vertices p and q are joined by an edge if pq divides some irreducible character degree of G. It is proved that some simple groups are uniquely determined by their orders and their character degree graphs. But since the character degree graphs of the characteristically simple groups are complete, there are very narrow class of characteristically simple groups which are characterizable by this method. We prove that the characteristically simple group A5 × A5 is uniquely determined by its order and its character degree graph. We note that this is the first example of a non simple group which is determined by order and character degree graph. As a consequence of our result we conclude that A5 × A5 is uniquely determined by its complex group algebra.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.