Abstract
Let G be a finite group and Irr(G) be the set of all complex irreducible characters of G. The character-graph Δ(G) associated to G, is a graph whose vertex set is the set of primes which divide the degrees of some characters in Irr(G) and two distinct primes p and q are adjacent in Δ(G) if the product pq divides χ(1), for some χ∈Irr(G). Tong-Viet posed the conjecture that if Δ(G) is k-regular for some integer k⩾2, then Δ(G) is either a complete graph or a cocktail party graph. In this paper, we show that his conjecture is true for all regular character-graphs whose eigenvalues are in the interval [−2,∞).
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.
