Energy of inverse graphs of dihedral and symmetric groups

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,...

Full description

Bibliographic Details
Main Authors: O. Ejima, K. O. AREMU, A. Audu
Format: Article
Language:English
Published: SpringerOpen 2020-08-01
Series:Journal of the Egyptian Mathematical Society
Subjects:
Online Access:http://link.springer.com/article/10.1186/s42787-020-00101-8