Papers
Topics
Authors
Recent
Search
2000 character limit reached

On some properties of enhanced power graph

Published 10 Jun 2016 in math.CO and math.GR | (1606.03209v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (2)

Collections

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