Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Sudip Bera
Department of Mathematics, Visva-Bharati, Santiniketan-731235, India.
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
On the intersection power graph of a finite group Sudip Bera
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2018.6.1.13

Abstract

Given a group G, the intersection power graph of G, denoted by GI(G), is the graph with vertex set G and two distinct vertices x and y are adjacent in GI(G) if there exists a non-identity element z ∈ G such that xm=z=yn, for some m, n ∈ N, i.e. x ∼ y in GI(G) if ⟨x⟩ ∩ ⟨y⟩ ≠ {e} and e is adjacent to all other vertices, where e is the identity element of the group G. Here we show that the graph GI(G) is complete if and only if either G is cyclic p-group or G is a generalized quaternion group. Furthermore, GI(G) is Eulerian if and only if ∣G∣ is odd. We characterize all abelian groups and also all non-abelian p-groups G, for which GI(G) is dominatable. Beside, we determine the automorphism group of the graph GI(Zn), when n ≠ pm.
Co-Authors