An elementary proof of a conjecture on graph-automorphism

DOI10.1016/J.ENDM.2017.11.020zbMATH Open1383.05215arXiv1606.07204OpenAlexW2963910807WikidataQ123218915 ScholiaQ123218915MaRDI QIDQ2413367FDOQ2413367

Authors: Sajal Kumar Mukherjee, Anjan Kumar Bhuniya 

Publication date: 10 April 2018

Abstract: In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

Full work available at URL: https://arxiv.org/abs/1606.07204

Recommendations

• The full automorphism group of the power (di)graph of a finite group
• The power graph of a finite group
• Automorphism group of certain power graphs of finite groups
• On the automorphisms group of finite power graphs
• Graphical cyclic permutation groups

zbMATH Keywords

automorphismgroupdegreecyclic grouppower graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Handbook of product graphs
• Title not available (Why is that?)
• Undirected power graphs of semigroups
• Power graphs: A survey
• Title not available (Why is that?)
• The full automorphism group of the power (di)graph of a finite group
• Title not available (Why is that?)
• Normal subgroup based power graphs of a finite group

Cited In (4)

• Proof Without Words: The Automorphism Group of the Petersen Graph Is Isomorphic to S₅
• Automatic proof of graph nonisomorphism
• The automorphism conjecture for small sets and series parallel sets
• The full automorphism group of the power (di)graph of a finite group

This page was built for publication: An elementary proof of a conjecture on graph-automorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413367)