August 29, 2024Open Access

On neighborhoods in the enhanced power graph associated with a finite group

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

This article investigates neighborhoods' sizes in the enhanced power graph (as known as the cyclic graph) associated with a finite group. In particular, we characterize finite p-groups with the smallest maximum size for neighborhoods of nontrivial element in its enhanced power graph.

Leer artículo completoexternamente

Me gusta

Guardar

Ver artículo completo

Cite This Study

Lewis et al. (Thu,) studied this question.

synapsesocial.com/papers/68e5a80fb6db64358754235e https://doi.org/https://doi.org/10.48550/arxiv.2408.16545

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the minimal (edge) connectivity of graphs and its applications to power graphs of finite groups2024
2Characteristics of the Enhanced Power Coprime Graphs of Some Finite Groups2025
3On the strong domination number of proper enhanced power graphs of finite groups2024
4An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups2024
5On finite groups whose power graphs are line graphs2024 · 2 citations

Me gusta

Guardar

Ver artículo completo