On prime coprime graphs of certain finite groups
Abstract
The prime coprime graph (G) of a finite group G is the graph whose vertex set is G and any two distinct vertices are adjacent if the greatest common divisor of their orders is either 1 or a prime. In this paper, we investigate Hamiltonicity, clique number, and vertex degree of (G) for cyclic, dihedral, and dicyclic groups G. We establish that (G) admits a (k,1)-partition for cyclic, dihedral, and dicyclic groups G of specified orders.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.