Abstract

The undirected power graph \$\$\textbackslashmathscr \G\(S)\$\$of a semigroup S is an undirected graph with vertex set S where two vertices \$\$u,v\textbackslashin S\$\$are adjacent if and only if there is a positive integer m such that \$\$uˆ\m\=v\$\$or \$\$vˆ\m\=u\$\$. Here, we investigate the power graphs of a class of abelian groups and answer, in this case, the question whether or not the power graph is Hamiltonian.

Links and resources

Tags