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