A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A b s t r ac t. The power graph of a finite group is the graph whose vertices are the elements of the group and two distinct vertices are adjacent if and only if one is an integral power of the other. In this paper we discuss the planarity and vertex connectivity of the power graphs of finite cyclic, dihedral and dicyclic groups. Also we apply connectivity concept to prove that the power graphs of both dihedral and dicyclic groups are not Hamiltonian.fatcat:hoirulh4tngdnk3popdmt4z6hy