Groups with maximum vertex degree commuting graphs

Abstract

Let G be a group and Z(G) be its center. We associate a commuting graph (G), whose vertex set is G Z(G) and two distinct vertices are adjacent if they commute. We say that (G) is strong k star free if the k star graph is not a subgraph of (G). In this paper, we characterize all strong 5 star free commuting graphs. As a byproduct, we classify all strong claw-free graphs. Also, we prove that the set of all non-abelian groups whose commuting graph is strong k star free is finite.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…