References

1

M.S. Chen, K.G. Shin, Processor allocation in an N-cube multiprocessor using gray codes, IEEE Transaction on Computer C-36 (1987) 1396-1407.

2

F.R.K. Chung, Diameters of graphs: Old problems and new results, Proc. 18th SouthEastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 60 (1987), 298-319.

3

F. Harary and J.P. Hayes, Edge fault tolerance in graphs, Networks 23 (1993) 135-142.

4

F. Harary and J.P. Hayes, Node fault tolerance in graphs, Networks 27 (1996) 19-23.

5

F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays $\cdot$ Trees $\cdot$ Hypercubes, Morgan Kaufmann Publishers, San Mateo, CA, 1992.

6

K. Mukhopadhyaya and B.P. Sinha, Hamiltonian graphs with minimum number of edges for fault-tolerant topologies, Information Processing Letters 44 (1992) 95-99.

7

O. Ore, Coverings of graphs, Ann. Mat. Pura Appl. 55 (1961) 315-321.

8

M. Paoli, W.W. Wong and C.K. Wong, Minimum k-Hamiltonian graphs II, Journal of Graph Theory 10 (1986) 79-95.

9

A. Sen, A. Sengupta, S. Bandyopadhyay, On some topological properties of hypercube, incomplete hypercube and supercube, in: Proc. International Parallel Processing Symposium, Newport Beach, April, 1993, 636-642.

10

T.Y. Sung, T.Y. Ho, and L.H. Hsu, Optimal k-fault-tolerant networks for token rings, accepted by Journal of Information Science and Engineering.

11

Y.C. Tseng, S.H. Chang, J.P. Sheu, Fault-tolerant ring embedding in a star graph with both link and node failures, IEEE Transactions on Parallel and Distributed Systems 8 (1997) 1185-1195.

12

J.J. Wang, C.N. Hung, and L.H. Hsu, Optimal 1-hamiltonian graphs, Information Processing Letters 65 (1998), 95-99.

13

W.W. Wong and C.K. Wong, Minimum k-Hamiltonian graphs, Journal of Graph Theory 8 (1984) 155-165.