On Power Graph Representation of Γ_1-nonderanged Permutation Group

A -nonderanged permutation group is a permutation group such that where . In this paper, an undirected power graph representation of -nonderanged permutation group denoted by has been studied. It was proved, among other things, that the graph is connected for any and is neither regular nor complete except at Also, the maximum degree of is and the girth is three (3) for any while the diameter is one (1) for and two (2) for. Furthermore, the central vertex of the graph was proved to be for any and while the peripheral vertex is for p > 5. Lastly, the adjacency matrix of some selected graphs and their graphical representations were given to support our findings.

Authors

Institutions

Publication Details

Journal
UMYU Scientifica
Published
2025-03-19
DOI
https://doi.org/10.56919/usci.2541.006
Citations
1
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Power Graph Representation of Γ_1-nonderanged Permutation Group

Anas Yusuf, A. Umar
1 citations
UMYU Scientifica
Graph Labeling and Dimension Problems
1.50
article

On Power Graph Representation of Γ_1-nonderanged Permutation Group

Anas Yusuf, A. Umar
article en
1 citations

Abstract

A -nonderanged permutation group is a permutation group such that where . In this paper, an undirected power graph representation of -nonderanged permutation group denoted by has been studied. It was proved, among other things, that the graph is connected for any and is neither regular nor complete except at Also, the maximum degree of is and the girth is three (3) for any while the diameter is one (1) for and two (2) for. Furthermore, the central vertex of the graph was proved to be for any and while the peripheral vertex is for p > 5. Lastly, the adjacency matrix of some selected graphs and their graphical representations were given to support our findings.

UMYU ScientificaVol. 4(1)
Federal University Birnin Kebbi (NG)
Openalex Percentile: Top 19%
Graph Labeling and Dimension Problems
1.50
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.