Abstract. The power graph 𝑃 (𝐺) of a group 𝐺 is the graph whose vertex set is the group elements and two elements are adjacent if one is a power of the other. In this paper, we consider some graph ...

This is known for finite graphs. The proof uses the existence of two edge-disjoint spanning trees in 4-edge-connected graphs. In the infinite case, it would be enough to prove that a 4-edge-connected ...