# On the minimum cut-sets of the power graph of a finite cyclic group

@inproceedings{Mukherjee2022OnTM, title={On the minimum cut-sets of the power graph of a finite cyclic group}, author={Sanjay Mukherjee and Kamal Lochan Patra and Binod Kumar Sahoo}, year={2022} }

The power graph P ( G ) of a ﬁnite group G is the simple graph with vertex set G , in which two distinct vertices are adjacent if one of them is a power of the other. For an integer n ≥ 2, let C n denote the cyclic group of order n and let r be the number of distinct prime divisors of n . The minimum cut-sets of P ( C n ) are characterized in [4] for r ≤ 3. In this paper, for r ≥ 4, we identify certain cut-sets of P ( C n ) such that any minimum cut-set of P ( C n ) must be one of them.

## References

SHOWING 1-10 OF 23 REFERENCES

### The Complexity of Power Graphs Associated With Finite Groups

- MathematicsContributions Discret. Math.
- 2018

The purpose of this paper is to find the complexity of a clique-replaced graph and derive some explicit formulas concerning the complexity \kappa(P(G)) for various groups G such as the cyclic group of order n, the simple groups L_2(q), the extra- special p-groups of order p^3, the Frobenius groups, etc.

### Finite groups with the same power graph

- MathematicsCommunications in Algebra
- 2021

Abstract The power graph P(G) of a group G is a graph with vertex set G, where two vertices u and v are adjacent if and only if and or for some positive integer m. In this paper, we raise and study…

### On connectedness of power graphs of finite groups

- MathematicsJournal of Algebra and Its Applications
- 2018

The power graph of a group [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices are adjacent if one is a power of the other. This paper investigates the…

### Strong metric dimensions for power graphs of finite groups

- Mathematics
- 2020

Abstract Let G be a finite group. The order supergraph of G is the graph with vertex set G, and two distinct vertices x, y are adjacent if or The enhanced power graph of G is the graph whose vertex…

### Some results on the power graphs of finite groups

- Mathematics
- 2015

We classify planar graphs and complete power graphs of groups and show that the only infinite group with a complete power graph is the Prufer group Zp1 . Clique and chromatic numbers and the…

### Coloring the Power Graph of a Semigroup

- MathematicsGraphs Comb.
- 2017

It is shown that the chromatic number of P(G) is at most countable, answering a recent question of Aalipour et al.

### Vertex connectivity of the power graph of a finite cyclic group

- MathematicsDiscret. Appl. Math.
- 2019

### Minimal cut-sets in the power graphs of certain finite non-cyclic groups

- Mathematics
- 2018

Abstract We study minimal cut-sets of the power graph of a finite non-cyclic nilpotent group which are associated with its maximal cyclic subgroups. As a result, we find the vertex connectivity of…

### Undirected power graphs of semigroups

- Mathematics
- 2009

The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,b∈S are adjacent if and only if a≠b and am=b or bm=a for some positive integer m. In…