Permutability graph of cyclic subgroups
R. Rajkumar, P. Devi

TL;DR
This paper classifies finite groups based on properties of their permutability graphs of cyclic subgroups, exploring structural, planarity, and connectivity aspects of these graphs.
Contribution
It provides a comprehensive classification of finite groups whose permutability graphs of cyclic subgroups exhibit specific graph-theoretic properties and analyzes their structural characteristics.
Findings
Classified groups with bipartite, star, triangle-free, and other graph properties.
Determined conditions for planarity of abelian groups' permutability graphs.
Analyzed connectedness, diameter, girth, and regularity of these graphs.
Abstract
Let be a group. \textit{The permutability graph of cyclic subgroups of }, denoted by , is a graph with all the proper cyclic subgroups of as its vertices and two distinct vertices in are adjacent if and only if the corresponding subgroups permute in . In this paper, we classify the finite groups whose permutability graph of cyclic subgroups belongs to one of the following: bipartite, tree, star graph, triangle-free, complete bipartite, , , , -free, unicyclic. We classify abelian groups whose permutability graph of cyclic subgroups are planar. Also we investigate the connectedness, diameter, girth, totally disconnectedness, completeness and regularity of these graphs.
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
