Communications in Algebra · 2018 · 15 citations · 19 references
Natural SciencesMathematicsCombinatoricsComputational GeometryGraph VisualizationGraph AlgorithmsGraph TheoryGroup StructureGroup TheoryTopological CombinatoricsAlgebraic Graph TheoryFinite Abelian GroupsGeometric Graph TheoryGraph ConnectivityNode DegreeVertex Connectivity
In this paper, the minimum degree of power graphs of certain cyclic groups, abelian p-groups, dihedral groups and dicyclic groups are obtained. It is ascertained that the edge-connectivity and minimum degree of power graphs are equal, and consequently, the minimum disconnecting sets of power graphs of the aforementioned groups are determined. In order to investigate the equality of connectivity and minimum degree of power graphs, certain necessary conditions for finite groups and a necessary and sufficient condition for finite cyclic groups are obtained. Moreover, the equality is discussed for the power graphs of abelian p-groups, dihedral groups and dicyclic groups.
19
Congruent Graphs and the Connectivity of Graphs
Hassler Whitney · American Journal of Mathematics · 1932 · 855 citations
Undirected power graphs of semigroups
Ivy Chakrabarty, M. K. Sen · Semigroup Forum · 2009 · 305 citations
The power graph of a finite group
Peter J. Cameron · Discrete Mathematics · 2010 · 224 citations
The power graph of a finite group, II
Peter J. Cameron · Journal of Group Theory · 2010 · 142 citations