T. Baskoro, M. Miller and J. Plesnk , On the structure of digraphs with order close to the Moore bound, Graphs Combin., 14 (1998) 109-119.

J. M. Brunat, M. A. Fiol and M. L. Fiol, Digraphs on permutations, Discrete Math., 174 (1997) 73-86.

S. C. Chern, T. C. Tuan, J. S. JWO, Hamiltonicity, vertex symmetry, and broadcasting of uni-directional hypercubes, IEEE Proceedings - Computers and Digital Techniques 144 (1997) 169--173.

Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo, Uni-directional alternating group graphs, Lecture Notes in Comput. Sci., 959 (1995) 490-495.

F. Comellas, M. A. Fiol, J. Gimbert and M. Mitjana, Weakly distance-regular digraphs, J. Combin. Theory Ser. B, (2004) 233-255.

F. Comellas, M. A. Fiol and J Gomez, On large vertex symmetric 2-reachable digraphs, Parallel Processing Lett., 4 (1994) 379-384.

F. Comellas and M. Mitjana, Broadcasting in cycle prefix digraphs, Discrete Appl. Math., 83 (1998) 31-39.

F. Comellas and M. Mitjana, Cycles in the cycle prefix digraph, Ars Combin., 60 (2001) 171-180.

F. Comellas and M. Mitjana, The spectra of cycle prefix digraphs, SIAM Journal on Discrete Mathematics, 2003.

M. Espona and O Serra, Cayley digraphs based on the de Bruijn networks, SIAM J. Discrete Math., 1998.

L. Gardner, Z. Miller, D. Pritikin and I. H. Sudborough, One-to-many embeddings of hypercubes into Cayley graphs generated by reversals, Theory Comput. Syst., 34 (2001) 399–431.

Linda Gardner, Zevi Miller, Dan Pritikin, I. Hal Sudborough, Embedding Hypercubes into Pancake, Cycle Prefix and Substring Reversal Networks, Proceedings of the 28th Annual Hawaii International Conference on System Sciences (1995) 537-545.

J. Gómez，Large vertex symmetric digraphs，Networks，Volume 50, Issue 4, pages 241–250, December 2007

J. Gómez，On Large vertex symmetric digraphs，Discrete Mathematics Discrete Math., 309(6),l 2009, 1213—1221.

M. C. Heydemann and B. Ducourthial, Cayley graphs and interconnection networks, Graph Symmetry, Algebraic Methods and Applications,“NATO ASI C”, 497 (1997) 167–226.

Hui-Ling Huang and Gen-Huey Chen, Shortest-Path Routing Algorithm and Topological Properties for Two-Level Hypernet Networks, ISPAN (1996) 97--103.

Hui-Ling Huang, Gen-Huey Chen, Topological properties and algorithms for two-level hypernet networks, Networks, 31 (1998) 105-118.

J. S. Jwo and T. C. Tuan, On container length and connectivity in unidirectional hypercubes, Networks, 32 (1998) 307-317.

J. S. Jwo and T. C. Tuan, Uni-Directional alternating group graphs, Journal of Information Science and Engineering, 15 (1999) 419-427.

H. Kiliccote, Y. Rachlin, C. Unsal, E. Guney and P. K. Khosla, Network-Embedded Databases, Technical Report, Institute for Complex Engineered Systems (ICES),

E Knill, Notes on the connectivity of Cayley coset digraphs, Los Alamos National Laboratory Report LAUR-94-3719, 1994, arXiv:math.CO/9411221.

S. C. Liaw, G. J. Chang, F. Cao and D. F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Ann. Combin., 2 (1998) 165-172.

H. Macbeth, J. ?iagiová, J. ?iráň, and T. Vetrík, Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter, J. Graph Theory, DOI: 10.1002/jgt.20439.

Mirka Miller and Jozef Siran, Moore graphs and beyond: A survey of the degree/diameter problem, Electron. J. Combin. (2005) #DS14.

L. Morales, I. Sudborough, Comparing Star and Pancake Networks, spdp, pp.612, 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 1996

S. Ponnuswamy and V. Chaudhary, A comparative study of star graphs and rotator graphs, Proceedings of the International Conference on Parallel Processing, 1 (1994) 46-50.

S. Ponnuswamy and V. Chaudhary, Analysis of fault tolerance in Cayley digraphs using forbidden faulty sets, Proceedings of the International Conference on Parallel and Distributed Computing and Systems, (1994) 346--349

S. Ponnuswamy, V Chaudhary, Embedding of meshes on rotator graphs, circuits and systems, Proceedings of the IEEE Midwest Conference on Circuits and Systems, (1993) 5-8.

Jana ?iagiová and Tomá? Vetrík，Large vertex-transitive and Cayley graphs with given degree and diameter，Electronic Notes in Discrete Mathematics 28 (2007) 365–369.

P. K. Srimani, Super rotator: incrementally extensible directed network graph of sublogarithmic diameter, Parallel Processing Letters, 1996.

S. Sur Srimanipk, IEH Graphs: A novel generalization of hypercube graphs, Acta Inform., 32 (1995) 597-609.

L. B. Stiller, Exploiting symmetry on parallel architectures, Ph. D. Thesis, The Johns Hopkins University 1995.

Berthold Vocking, Shortest Paths Routing on Arbitrary Networks, Diploma thesis, Heinz Nixdorf Institute, University of Paderborn, October 1994.

Chi-Hsiang Yeh and Emmanouel A. Varvarigos, A Mathematical Game and Its Applications to the Design of Interconnection Networks, Proceedings International Conference on Parallel Processing, (2001) 21-30.

Nian (Alfred) Zhou, The Broadcasting Problem For Bounded-Degree Directed Networks, University of Auckland.