Abstract
Let (G,∗) be a finite group and S={x∈G|x≠x−1} be a subset of G containing its non-self invertible elements. The inverse graph of G denoted by Γ(G) is a graph whose set of vertices coincides with G such that two distinct vertices x and y are adjacent if either x∗y∈S or y∗x∈S. In this paper, we study the energy of the dihedral and symmetric groups, we show that if G is a finite non-abelian group with exactly two non-self invertible elements, then the associated inverse graph Γ(G) is never a complete bipartite graph. Furthermore, we establish the isomorphism between the inverse graphs of a subgroup Dp of the dihedral group Dn of order 2p and subgroup Sk of the symmetric groups Sn of order k! such that 2p = n!~(p,n,k geq 3~text {and}~p,n,k in mathbb {Z}^{+}).
Highlights
Graph representation is one of the combinatorial properties used to understand some interesting properties of complex structures
In this paper, motivated by the works of Alfuraidan and Zakariya [1], Gutman [7], and Fadzil et al [9], we compute the energy of some inverse graphs which is the sum of the absolute values of the eigenvalues of adjacency matrices of their corresponding inverse graphs of finite groups
We study the energy of dihedral and symmetry groups and show that if G is a finite non-abelian group with exactly two non-self invertible elements, the associated inverse graph (G) is never a complete bipartite graph
Summary
Graph representation is one of the combinatorial properties used to understand some interesting properties of complex structures. Alfuraidan and Zakariya [1] introduced and studied the inverse graphs associated with finite groups. In this paper, motivated by the works of Alfuraidan and Zakariya [1], Gutman [7], and Fadzil et al [9], we compute the energy of some inverse graphs which is the sum of the absolute values of the eigenvalues of adjacency matrices of their corresponding inverse graphs of finite groups.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.