Abstract
Let Γ be a finite simple graph. If for some integer Γ is a Kn -free graph whose complement has an odd cycle of length at least then we say that Γ is an n-exact graph. For a finite group G, let denote the character graph built on the set of degrees of the irreducible complex characters of G. In this paper, we prove that the order of an n-exact character graph is at most Also we determine the structure of all finite groups G with extremal n-exact character graph.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
