Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a finite group   G     G       , the  por graph   P(G)     P   (  G  )         is a graph with the vertex set   G     G       , in which two distinct elements are adjacent if one is a por of the other. Feng, Ma and Wang (Feng et al., 2016) described the full automorphism group of   P(G)     P   (  G  )        . ,  study automorphism groups of the main supergraphs and cyclic graphs, which are supergraphs of   P(G)     P   (  G  )        . It is proved that the automorphism group of these graphs can be written as a combination of Cartesian and wreath products of some symmetric groups. The full automorphism groups of these graphs of certain finite groups are also calculated.
['Asma Hamzeh', 'Ali Reza Ashrafi']
I am writing a research paper on a idea Automorphism groups of supergraphs of the power graph of a finite group
[{"from": "human", "value": "I am writing a research paper on a idea Automorphism groups of supergraphs of the power graph of a finite group"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a finite group   G     G       , the  por graph   P(G)     P   (  G  )         is a graph with the vertex set   G     G       , in which two distinct elements are adjacent if one is a por of the other. Feng, Ma and Wang (Feng et\u00a0al., 2016) described the full automorphism group of   P(G)     P   (  G  )        . ,  study automorphism groups of the main supergraphs and cyclic graphs, which are supergraphs of   P(G)     P   (  G  )        . It is proved that the automorphism group of these graphs can be written as a combination of Cartesian and wreath products of some symmetric groups. The full automorphism groups of these graphs of certain finite groups are also calculated."}]