Inverse graphs associated with finite groups

Abstract

Let $(\Gamma,*)$ be a finite group and $S$ a possibly empty subset of $\Gamma$ containing its non-self-invertible elements. In this paper, we introduce the inverse graph associated with $\Gamma$ whose set of vertices coincides with $\Gamma$ such that two distinct vertices $u$ and $v$ are adjacent if and only if either $u * v\in S$ or $v * u\in S$. We then investigate its algebraic and combinatorial structures.

Keywords

• finite group, inverse graph, non-self-invertible, planar graphs, hamiltonian graphs