Abstract

The directed power graph $$\vec {\mathcal {G}}( G)$$ of a group G is the simple digraph with vertex set G in which $$x\rightarrow y$$ if y is a power of x, and the power graph is the underlying simple graph $$\mathcal {G}( G)$$ . In this paper, three versions of the definition of the power graph are discussed, and it is proved that the power graph by any of the three versions of the definition determines the other two up to isomorphism. It is also proved that if G is a torsion-free group of nilpotency class 2 and if H is a group such that $$\mathcal {G}( H)\cong \mathcal {G}( G)$$ , then G and H have isomorphic directed power graphs, which was an open problem proposed by Cameron, Guerra and Jurina [9].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call