Abstract
An undirected graph called Square graph Γ(G) of a finite group G is introduced and defined as an undirected simple graph whose vertex set is G and two distinct vertices a and b are adjacent if and only if a2 = b or b2 = a. In this paper, for a finite group G, the number of edges of Γ(G) is computed. An upper bound to the clique number of Γ(G) and upper bound to the maximum degree of square graphs of finite cyclic groups are obtained.
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.
