• Corpus ID: 252567951

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}
}

• S. Mukherjee, K. Patra, B. K. Sahoo
• Published 28 September 2022
• Mathematics

The power graph P ( G ) of a finite 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.