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

DOI10.1142/s0219498824501767zbMATH Open1547.05121MaRDI QIDQ6608205

Sanjay Mukherjee, Binod K. Sahoo, Kamal L. Patra

Publication date: 19 September 2024

Published in: Journal of Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

cyclic grouppower graphEuler's totient functioncut-set

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cites Work

• Unnamed Item
• The structure and metric dimension of the power graph of a finite group
• Edge-maximality of power graphs of finite cyclic groups
• The power graph of a finite group
• The full automorphism group of the power (di)graph of a finite group
• The strong metric dimension of the power graph of a finite group
• Coloring the power graph of a semigroup
• Vertex connectivity of the power graph of a finite cyclic group
• On the chromatic number of the power graph of a finite group
• Undirected power graphs of semigroups
• On the power graph of a finite group
• The Complexity of Power Graphs Associated With Finite Groups
• On connectedness of power graphs of finite groups
• Recent developments on the power graph of finite groups – a survey
• Finite groups with the same power graph
• Vertex connectivity of the power graph of a finite cyclic group II
• Erratum: Vertex connectivity of the power graph of a finite cyclic group II
• Strong metric dimensions for power graphs of finite groups
• Power graphs: A survey
• Minimal cut-sets in the power graphs of certain finite non-cyclic groups
• An Euler totient sum inequality

This page was built for publication: On the minimum cut-sets of the power graph of a finite cyclic group