On Tue, Jul 28, 2020 at 10:48:11PM +0500, Fawad Hayat wrote: > Thank you Sir, for your kind response. Actually, we have a definition of > the power graph of a group G, “Two elements x, y of G being adjacent iff > one element is a power of the other, i.e., x^n=y or y^n=x.” So I would like > to find all those elements which satisfy this condition. In The following > program I need the set M and MM which I defined. If the following program > have some problems please correct that for me, I’ll be very grateful to > you.
I would replace the condition x^n=y or y^n=x by (x in <y>) or (y in <x>), that is: (x in Subgroup(G,y)) or (y in Subgroup(G,x)) Cheers, Bill. _______________________________________________ Forum mailing list [email protected] https://mail.gap-system.org/mailman/listinfo/forum
