English

Normal Subgroup Based Power Graph of a finite Group

Combinatorics 2016-01-19 v1 Group Theory

Abstract

For a finite group GG with a normal subgroup HH, the normal subgroup based power graph of GG, denoted by ΓH(G)\Gamma_H(G) whose vertex set V(ΓH(G))=(GH){e}V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\} and two vertices aa and bb are edge connected if aH=bmHaH=b^mH or bH=anHbH=a^nH for some m,nNm, n \in \mathbb{N}. In this paper we obtain some fundamental characterizations of the normal subgroup based power graph. We show some relation between the graph ΓH(G)\Gamma_H(G) and the power graph Γ(GH)\Gamma(\frac{G}{H}). We show that ΓH(G)\Gamma_H(G) is complete if and only of GH\frac{G}{H} is cyclic group of order 11 or pmp^m, where pp is prime number and mNm\in \mathbb{N}. ΓH(G)\Gamma_H(G) is planar if and only if H=2|H|=2 or 33 and GHZ2×Z2××Z2\frac{G}{H}\cong \mathbb{Z}_2\times \mathbb{Z}_2 \times \cdots \times \mathbb{Z}_2. Also ΓH(G)\Gamma_H(G) is Eulerian if and only if GH|G|\equiv |H| mod2 2.

Keywords

Cite

@article{arxiv.1601.04431,
  title  = {Normal Subgroup Based Power Graph of a finite Group},
  author = {A. K. Bhuniya and Sudip Bera},
  journal= {arXiv preprint arXiv:1601.04431},
  year   = {2016}
}

Comments

14 pages, 4 figures

R2 v1 2026-06-22T12:31:29.276Z