  The Directed Power Graph of a group is a graph whose vertex set is the
elements of the group, with an edge from $x$ to $y$ if $y$ is a power of $x$.
The \textit{Power Graph} of a group can be obtained from the directed power
graph by disorienting its edges. This article discusses properties of cliques,
cycles, paths, and coloring in power graphs of finite groups. A construction of
the longest directed path in power graphs of cyclic groups is given, along with
some results on distance in power graphs. We discuss the cyclic subgroup graph
of a group and show that it shares a remarkable number of properties with the
power graph, including independence number, completeness, number of holes etc.,
with a few exceptions like planarity and Hamiltonian.
