Graphs and Combinatorics · 2020 · 27 citations · 10 references
Natural SciencesCommunicationCombinatoricsGroup DynamicsGroup WorkGraph AlgorithmsGraph TheoryGroup TheoryClique StructureCliquesGraph ConnectivityIndependenceTorsionVertex Connectivity
Abstract Let G be a group. The power graph of G is a graph with vertex set G in which two distinct elements x , y are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence number, show that they have clique cover number equal to their independence number, and calculate this number. The proper power graph is the induced subgraph of the power graph on the set $$G-\{1\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:mi>G</mml:mi><mml:mo>-</mml:mo><mml:mo>{</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math> . A group whose proper power graph is connected must be either a torsion group or a torsion-free group; we give characterizations of some groups whose proper power graphs are connected.
10
Alexander Lubotzky, Ralph S. Phillips, Peter Sarnak · COMBINATORICA · 1988 · 1K citations
Normal hypergraphs and the perfect graph conjecture
László Lovász · Discrete Mathematics · 1972 · 762 citations
Undirected power graphs of semigroups
Ivy Chakrabarty, M. K. Sen · Semigroup Forum · 2009 · 305 citations