arXiv Analytics

Sign in

arXiv:1606.07204 [math.CO]AbstractReferencesReviewsResources

An elementary proof of a conjecture on graph-automorphism

Sajal Kumar Mukherjee, A. K. Bhuniya

Published 2016-06-23Version 1

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.

Comments: 5 pages
Categories: math.CO, math.GR
Subjects: 05C25
Related articles: Most relevant | Search more
arXiv:1306.2930 [math.CO] (Published 2013-06-12, updated 2015-08-01)
Another proof of Wilmes' conjecture
arXiv:math/0009230 [math.CO] (Published 2000-09-26)
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi

Links

Toolbox