The Minimal (Edge) Connectivity of Some Graphs of Finite Groups

Abstract

In this paper, we classify all the finite groups G such that the commuting graph C(G), order-sum graph OS(G) and non-inverse graph NI(G) are minimally edge connected graphs. We also classify all the finite groups G for that, these graphs are minimally connected. We also classify some groups for that the co-prime graph CP(G) has minimal edge connectedness. In final part, we classify all the finite groups G for that co-prime graph CP(G) is minimally connected.

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…