Abstract
Let G be a finite non-abelian group and let be a set of elements of G. Let A be the set of commuting elements in , i.e A = {v ∈ : vg = gv,g ∈ G}. In this paper, we extend the work on centralizer graph by defining a new graph called the isotropy graph, denoted as iso. The vertices of this graph are proper isotropy groups. In other words, |V ( iso)| = StabG()−A, where StabG() is the number of stabilizers under group action of G on and A is the number of improper isotropy groups under group action on a set. Two vertices are connected by an edge if their cardinalities are identical.
Published Version (
Free)
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: International Electronic Journal of Pure and Applied Mathematics
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.
