The minimal (edge) connectivity of some graphs of finite groups

In this paper, we classify all the finite groups [Formula: see text] such that the commuting graph [Formula: see text], order-sum graph [Formula: see text] and non-inverse graph [Formula: see text] are minimally edge connected graphs. We also classify all the finite groups [Formula: see text] for that, these graphs are minimally connected. We also classify some groups for that the co-prime graph [Formula: see text] has minimal edge connectedness. In final part, we classify all the finite groups [Formula: see text] for that co-prime graph [Formula: see text] is minimally connected.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2026-01-23
DOI
https://doi.org/10.1142/s1793830926500138
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The minimal (edge) connectivity of some graphs of finite groups

Vipul Kakkar, Siddharth Malviy
Discrete Mathematics Algorithms and Applications
Finite Group Theory Research
article

The minimal (edge) connectivity of some graphs of finite groups

Vipul Kakkar, Siddharth Malviy
article en

Abstract

In this paper, we classify all the finite groups [Formula: see text] such that the commuting graph [Formula: see text], order-sum graph [Formula: see text] and non-inverse graph [Formula: see text] are minimally edge connected graphs. We also classify all the finite groups [Formula: see text] for that, these graphs are minimally connected. We also classify some groups for that the co-prime graph [Formula: see text] has minimal edge connectedness. In final part, we classify all the finite groups [Formula: see text] for that co-prime graph [Formula: see text] is minimally connected.

Discrete Mathematics Algorithms and Applications
Central University of Rajasthan (IN)
Openalex Percentile: Top 77%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The minimal (edge) connectivity of some graphs of finite groups — Vipul Kakkar, Siddharth Malviy · Discrete Mathematics Algorithms and Applications (2026) | TGRS Research Map | TGRS