Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 27 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 227 tok/s Pro
2000 character limit reached

On some properties of enhanced power graph (1606.03209v1)

Published 10 Jun 2016 in math.CO and math.GR

Abstract: Given a group $G$, the enhanced power graph of $G$ denoted by $\mathcal{G}_e(G)$, is the graph with vertex set $G$ and two distinct vertices $x, y$ are edge connected in $\mathcal{G}_e(G)$ if there exists $z\in G $ such that $x=zm$ and $ y=zn $, for some $m, n\in \mathbb{N}$. In this article, we characterize the enhanced power graph $\mathcal{G}_e(G)$ of $G$. The graph $\mathcal{G}_e(G)$ is complete if and only if $G$ is cyclic, and $\mathcal{G}_e(G)$ is Eulerian if and only if $|G|$ is odd. We classify all abelian groups and also all non-abelian $p-$groups $G$ for which $\mathcal{G}_e(G)$ satisfies the cone property.

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.