On the power graph of a finite group
Abstract
The power graph PG of a finite group G is the graph with the vertex set G, where two elements are adjacent if one is a power of the other. We first show that PG has an transitive orientation, so it is a perfect graph and its core is a complete graph. Then we use the poset on all cyclic subgroups (under usual inclusion) to characterise the structure of PG. Finally, the closed formula for the metric dimension of PG is established. As an application, we compute the metric dimension of the power graph of a cyclic group.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.