We call a Cayley digraph X= Cay (G, S) normal for G if the right regular representation R (G)
of G is normal in the full automorphism group Aut (X) of X. In this paper we give some …

Due to recent developments of parallel and distributed computing, the design and analysis
of various interconnection networks has been a main topic of research for the past few years …

Motivated by the study of large graphs with given degree and diameter, and the recent
interest in the design of highly symmetric interconnection networks (eg, the study of Cayley …

Alternating group graphs AG n, studied by Jwo and others, constitute a class of Cayley
graphs that possess certain desirable properties compared with other regular networks …

Cayley Graphs with Optimal Fault Tolerance Page 1 IEEE TRANSACTIONS ON COMPUTERS,
VOL. 41, NO. 10, OCTOBER 1992 Cayley Graphs with Optimal Fault Tolerance Brian Alspach …

A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are
rooted at the same vertex r, and for each vertex v (≠ r) in G, the two paths from v to r in any …

In this paper, we show that the two unidirectional binary n‐cubes, namely, Q1 (n) and Q2 (n),
proposed as high‐speed networking schemes by Chou and Du are maximum fault‐tolerant …

A class of uni-directional Cayley graphs based on alternating groups is proposed in this
paper. It is shown that this class of graphs is strongly connected and recursively scalable …

In this paper, we propose a recursive algorithm and a parallel algorithm for constructing
independent spanning trees in ANn. The main ideas of the recursive algorithm are to …

Bases of certain finite groups Page 1 ANNALES MATHÉMATIQUES BLAISE PASCAL
RAFFAELE SCAPELLATO LIBERO VERARDI Bases of certain finite groups Annales …