Abstract
For a simple undirected graph [Formula: see text] and [Formula: see text], [Formula: see text], the universal adjacency matrix [Formula: see text], where [Formula: see text] is the identity matrix, [Formula: see text] is the all-ones matrix, and [Formula: see text] and [Formula: see text] are the adjacency and degree diagonal matrices of [Formula: see text], respectively. For a finite non-abelian group [Formula: see text] and [Formula: see text], the commuting graph [Formula: see text] is a simple undirected graph with vertex set [Formula: see text] and the adjacency rule is commuting. The non-commuting graph of [Formula: see text] is the complement of [Formula: see text]. An AC-group is a non-abelian group such that the centralizer of every non-central element is abelian. In this paper, we obtain the universal adjacency eigenpairs of the commuting and non-commuting graphs for an arbitrary AC-group [Formula: see text] with [Formula: see text] or [Formula: see text]. Moreover, we determine the eigenpairs of [Formula: see text] when [Formula: see text] is a specific kind of group.
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.
