• 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}
}
• Published 28 September 2022
• Mathematics
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

• Mathematics
Contributions 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.
• Mathematics
Communications 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
• Mathematics
Journal 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
• 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
• 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
It is shown that the chromatic number of P(G) is at most countable, answering a recent question of Aalipour et al.
• 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
• 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