Groups with maximum vertex degree commuting graphs
arXiv:1908.08226
Abstract
Let be a group and be its center. We associate a commuting graph , whose vertex set is and two distinct vertices are adjacent if they commute. We say that is strong star free if the star graph is not a subgraph of . In this paper, we characterize all strong 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 star free is finite.
11 pages, 4 figures. To appear in Indian Journal of Pure and Applied Mathematics