CAYLEY GRAPHS

A graph is said to be vertex-transitive or edge-transitive if the automorphism group of acts transitively on V () or E(), respectively. Let = Cay(G;S) be a Cayley graph on G relative to S. Then, is said to be normal edge-transitive, if NAut()(G) acts transitively on edges. In this paper, the eigenval-ues of normal edge-transitive Cayley graphs of the groups D2n and T4n are given.

Based on the Cayley graph framework for the generationand application independent evaluation of multiprocessor interconnectiontopologies, an application dependent task mappingproblem is addressed. In particular, we start from an interconnectiontopology considered attractive from a graph theoreticalpoint of view which is produced by an applicationindependentCayley graph approach. Given such a graphtogether with an application dependent task communicationprofile, the problem addressed in...

An important part of computer science is focused on the links that can be established between group theory and graph theory and graphs. Cayley graphs, that establish such a link, are useful in a lot of areas of sciences. This paper introduces a new type of graph associated with a group, the G-graphs, and presents many of their properties. We