Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 26 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Certain properties of the enhanced power graph associated with a finite group (2207.05075v1)

Published 11 Jul 2022 in math.GR and math.CO

Abstract: The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we determine all finite groups such that the minimum degree and the vertex connectivity of $\mathcal{P}_E(G)$ are equal. Also, we classify all groups whose (proper) enhanced power graphs are strongly regular. Further, the vertex connectivity of the enhanced power graphs associated to some nilpotent groups is obtained. Finally, we obtain a lower bound and an upper bound for the Wiener index of $\mathcal{P}_E(G)$, where $G$ is a nilpotent group. The finite nilpotent groups attaining these bounds are also characterized.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.