Non-commuting graph of AC-groups: as matroids

Abstract

Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph G (called non-commuting graph of G) as follows: Take G(G) as the vertices of G and join x and y, whenever xy = yx. In this paper, we show that a finite group G is an AC-group, if and only if, the associated non-commuting graph of G is a matroid. Leveraging the properties of matroids, we further delve into the characteristics of AC-groups. Additionally, we provide a formula to compute the clique number of the non-commuting graph of AC-groups, offering a new perspective on the structure of these groups

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…