Finite groups whose commuting graphs are line graphs

Abstract

The commuting graph (G) of a group G is the simple undirected graph with group elements as a vertex set and two elements x and y are adjacent if and only if xy=yx in G. By eliminating the identity element of G and all the dominant vertices of (G), the resulting subgraphs of (G) are *(G) and **(G), respectively. In this paper, we classify all the finite groups G such that the graph (G) ∈ \(G), *(G), **(G)\ is the line graph of some graph. We also classify all the finite groups G whose graph (G) ∈ \(G), *(G), **(G)\ is the complement of line graph.

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…