The directed power graph of a group G is the digraph with vertex set G , having an arc from y to x whenever x is a power of y ; the undirected power graph has an edge joining x and y whenever one is a power of the other. We show that, for a finite group, the undirected power graph determines the directed power graph up to isomorphism. As a consequence, two finite groups which have isomorphic undirected power graphs have the same number of elements of each order.
Contents
-
Requires Authentication UnlicensedThe power graph of a finite group, IILicensedMay 30, 2010
-
Requires Authentication UnlicensedOn p-Brauer characters of p′-degree and self-normalizing Sylow p-subgroupsLicensedMay 30, 2010
-
Requires Authentication UnlicensedFinite groups whose irreducible characters vanish on at most three conjugacy classesLicensedMay 30, 2010
-
Requires Authentication UnlicensedThe conjugacy of triality subgroups of Sylow subloops of Moufang loopsLicensedMay 30, 2010
-
Requires Authentication UnlicensedOn two questions of L. A. Shemetkov concerning hypercyclically embedded subgroups of finite groupsLicensedMay 30, 2010
-
Requires Authentication UnlicensedPeriodic patterns in the graph of p-groups of maximal classLicensedMay 30, 2010
-
Requires Authentication UnlicensedLower bounds for representation growthLicensedMay 30, 2010
-
Requires Authentication UnlicensedReflexive group topologies on Abelian groupsLicensedMay 30, 2010
-
Requires Authentication UnlicensedOn abstract commensurators of groupsLicensedApril 23, 2010
-
Requires Authentication UnlicensedOn the SQ-universality of groups with special presentationsLicensedMay 30, 2010