Cyclic Subgroup Graph of a Group

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sharma, Khyati, Reddy, A. Satyanarayana
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913511755481088
author Sharma, Khyati
Reddy, A. Satyanarayana
author_facet Sharma, Khyati
Reddy, A. Satyanarayana
contents A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.Tărnăuceanu gave the formula to count the number of edges of these graphs. In this paper, we explore various properties of these graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2409_13796
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Cyclic Subgroup Graph of a Group
Sharma, Khyati
Reddy, A. Satyanarayana
Group Theory
Combinatorics
05C25, 20D60, and 20E28
A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.Tărnăuceanu gave the formula to count the number of edges of these graphs. In this paper, we explore various properties of these graphs.
title Cyclic Subgroup Graph of a Group
topic Group Theory
Combinatorics
05C25, 20D60, and 20E28
url https://arxiv.org/abs/2409.13796