Genus and crosscap of Normal subgroup based power graphs of finite groups

Abstract

Let H be a normal subgroup of a group G. The normal subgroup based power graph H(G) of G is the simple undirected graph with vertex set V(H(G))= (G H) \e\ and two distinct vertices a and b are adjacent if either aH = bm H or bH=anH for some m,n ∈ N. In this paper, we continue the study of normal subgroup based power graph and characterize all the pairs (G,H), where H is a non-trivial normal subgroup of G, such that the genus of H(G) is at most 2. Moreover, we determine all the subgroups H and the quotient groups GH such that the cross-cap of H(G) is at most three.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…