Reconstructing normal edge-transitive Cayley graphs of Abelian groups

Cayley graphs of groups have been used extensively for designing interconnection networks with optimal fault tolerance. ##On the other hand, normal edge-transitive Cayley graphs have been extensively studied by many authors and they are characterized in some classes of groups. ##In this paper, first we focus on reconstruction problem posed by Praeger and give necessary and sufficient condition for a Cayley graph of Abelian group to be normal edge-transitive. ##Then we investigate the main properties of these graphs as interconnection networks and we show that they have several supremacies comparing with many other known networks