Groups with maximum vertex degree commuting graphs
Sushil Bhunia, G. Arunkumar

TL;DR
This paper characterizes all groups whose commuting graphs do not contain a star with five leaves and classifies all strong claw-free graphs, revealing finiteness in certain non-abelian group classes.
Contribution
It provides a complete characterization of strong 5 star free commuting graphs and classifies all strong claw-free graphs, establishing finiteness results for non-abelian groups with these properties.
Findings
Characterization of all strong 5 star free commuting graphs
Classification of all strong claw-free graphs
Finiteness of non-abelian groups with strong k star free commuting graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Graph Theory Research · graph theory and CDMA systems
