The Minimal (Edge) Connectivity of Some Graphs of Finite Groups

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Malviy, Siddharth, Kakkar, Vipul
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909407741214720
author Malviy, Siddharth
Kakkar, Vipul
author_facet Malviy, Siddharth
Kakkar, Vipul
contents In this paper, we classify all the finite groups $G$ such that the commuting graph $Γ_C(G)$, order-sum graph $Γ_{OS}(G)$ and non-inverse graph $Γ_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite groups $G$ for that, these graphs are minimally connected. We also classify some groups for that the co-prime graph $Γ_{CP}(G)$ has minimal edge connectedness. In final part, we classify all the finite groups $G$ for that co-prime graph $Γ_{CP}(G)$ is minimally connected.
format Preprint
id arxiv_https___arxiv_org_abs_2411_18930
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Minimal (Edge) Connectivity of Some Graphs of Finite Groups
Malviy, Siddharth
Kakkar, Vipul
Combinatorics
In this paper, we classify all the finite groups $G$ such that the commuting graph $Γ_C(G)$, order-sum graph $Γ_{OS}(G)$ and non-inverse graph $Γ_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite groups $G$ for that, these graphs are minimally connected. We also classify some groups for that the co-prime graph $Γ_{CP}(G)$ has minimal edge connectedness. In final part, we classify all the finite groups $G$ for that co-prime graph $Γ_{CP}(G)$ is minimally connected.
title The Minimal (Edge) Connectivity of Some Graphs of Finite Groups
topic Combinatorics
url https://arxiv.org/abs/2411.18930