Intersection subgroup graph with forbidden subgraphs

Abstract

Let G be a group. The intersection subgroup graph of G (introduced by Anderson et al. anderson) is the simple graph S(G) whose vertices are those non-trivial subgroups say H of G with H K=\e\ for some non-trivial subgroup K of G; two distinct vertices H and K are adjacent if and only if H K=\e\, where e is the identity element of G. In this communication, we explore the groups whose intersection subgroup graph belongs to several significant graph classes including cluster graphs, perfect graphs, cographs, chordal graphs, bipartite graphs, triangle-free and claw-fee graphs. We categorize each nilpotent group G so that S(G) belongs to the above classes. We entirely classify the simple group of Lie type whose intersection subgroup graph is a cograph. Moreover, we deduce that S(G) is neither a cograph nor a chordal graph if G is a torsion-free nilpotent group.

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…