Finite groups with star-free noncyclic graphs
Xuanlong Ma, Gary L. Walls, Kaishun Wang

TL;DR
This paper classifies finite noncyclic groups based on the structure of their noncyclic graphs, specifically those that do not contain a star graph $K_{1,n}$ for certain values of n.
Contribution
It provides a complete classification of finite noncyclic groups with noncyclic graphs free of star subgraphs $K_{1,n}$ for 3 ≤ n ≤ 6.
Findings
Identifies all such groups for each n in the specified range.
Characterizes the structure of noncyclic graphs that are $K_{1,n}$-free.
Provides a framework for understanding the relationship between group structure and graph properties.
Abstract
For a finite noncyclic group , let be a set of elements of such that is cyclic for each of . The noncyclic graph of is a graph with the vertex set , having an edge between two distinct vertices and if is not cyclic. In this paper, we classify all finite noncyclic groups whose noncyclic graphs are -free, where .
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 · Coding theory and cryptography · graph theory and CDMA systems
