The enhanced quotient graph of the quotient of a finite group

Abstract

For a finite group G with a normal subgroup H, the enhanced quotient graph of G/H, denoted by GH(G), is the graph with vertex set V=(G H) \e\ and two vertices x and y are edge connected if xH = yH or xH,yH∈ zH for some z∈ G. In this article, we characterize the enhanced quotient graph of G/H. The graph GH(G) is complete if and only if G/H is cyclic, and GH(G) is Eulerian if and only if |G/H| is odd. We show some relation between the graph GH(G) and the enhanced power graph G(G/H) that was introduced by Sudip Bera and A.K. Bhuniya (2016). The graph GH(G) is complete if and only if G/H is cyclic if and only if G(G/H) is complete. The graph GH(G) is Eulerian if and only if |G| is odd if and only if G(G) is Eulerian, i.e., the property of being Eulerian does not depend on the normal subgroup H.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…