Cyclic Subgroup Graph of a Group
Abstract
A cyclic subgroup graph of a group G is a graph whose vertices are cyclic subgroups of G and two distinct vertices H1 and H2 are adjacent if H1≤ H2, and there is no subgroup K such that H1<K<H2. M.Tarnauceanu gave the formula to count the number of edges of these graphs. In this paper, we explore various properties of these graphs.
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.