Abstract
Let (Γ, *) be a finite group and S a possibly empty subset of Γ containing its non-self-invertible elements. In this paper, we introduce the inverse graph associated with Γ whose set of vertices coincides with Γ such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S. We then investigate its algebraic and combinatorial structures.
Original language | English |
---|---|
Pages (from-to) | 142-154 |
Number of pages | 13 |
Journal | Electronic Journal of Graph Theory and Applications |
Volume | 5 |
Issue number | 1 |
DOIs | |
State | Published - 2017 |
Keywords
- Finite group
- Hamiltonian graphs
- Inverse graph
- Non-self-invertible
- Planar graphs
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics