\chapter*{{\em The Complexity of Power Graphs Associated With Finite Groups}}
\pagenumbering{arabic}
\setcounter{page}{1}
\section{{\em Introduction}}
 {\em All graphs considered here are simple connected graphs.
A {\em spanning tree} of a  connected graph
 is just a subgraph that contains all the vertices and is a tree.
 Counting the number of spanning trees in a connected graph