We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected and have diameter at most $3$.

We investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.

For a group G, we define a graph $\Delta (G)$ by letting $G^{\scriptsize\#}=G\setminus {\{\,1\,\}} $ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\scriptsize\#}$ if and only if the subgroup $\langle x,y\rangle $ is cyclic. Recall that a Z-group is a group where every Sylow subgroup is cyclic. In this short note, we investigate $\Delta (G)$ for a Z-group G.