Minimum neighborhood in a generalized cube

Information Processing Letters

Volumn 97, Issue 3, 2006, Pages 88-93

  Yang, Xiaofan ^a,b   Cao, Jianqiu ^a   Megson, Graham M ^c   Luo, Jun ^b  

^a CHONGQING JIAOTONG UNIVERSITY   (China)

^b CHONGQING UNIVERSITY   (China)

^c UNIVERSITY OF READING   (United Kingdom)

Author keywords

Generalized cube; Hypercube; Interconnection networks; Minimum neighborhood problem

Indexed keywords

DATA PROCESSING; INTEGER PROGRAMMING; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

GENERALIZED CUBE; HYPERCUBE; HYPERCUBE-LIKE NETWORKS; MINIMUM NEIGHBORHOOD PROBLEMS;

GRAPH THEORY;

EID: 29144445894     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.003     Document Type: Article

References (21)

1. K.A.S. Abdel-Ghaffar Maximum number of edges joining vertices on a cube Inform. Process. Lett. 87 2 2003 95 99
2. S. Abraham, and K. Padmanabhan The twisted cube topology for multiprocessors: a study in network asymmetry J. Parallel Distrib. Comput. 13 1 1991 104 110
3. A. Caruso, S. Chessa, P. Maestrini, and P. Santi Diagnosability of regular systems J. Algorithms 45 2 2002 126 143
4. F.B. Chedid, and R.B. Chedid A new variation on hypercubes with smaller diameter Inform. Process. Lett. 46 6 1993 275 280
5. Y.C. Chen, J.J.M. Tan, L.H. Hsu, and S.S. Kao Super-connectivity and super-edge-connectivity for some interconnection networks Appl. Math. Comput. 140 2-3 2003 245 254
6. P. Cull, and S.M. Larson The Möbius cubes IEEE Trans. Comput. 54 2 1995 647 659
7. K. Efe The crossed cube architecture for parallel computation IEEE Trans. Parallel Distrib. Systems 3 5 1992 513 524
8. A.H. Esfahanian, L.M. Ni, and B.E. Sagan The twisted n-cube with application to multiprocessing IEEE Trans. Comput. 40 1 1991 88 93
9. J. Fan, and X. Lin The t / k -diagnosability of the BC graphs IEEE Trans. Comput. 54 2 2005 176 184
10. F. Harary Graph Theory 1969 Addison-Wesley Reading, MA
11. P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu The diagnosability of the matching composition network under the comparison diagnosis model IEEE Trans. Comput. 53 8 2004 1064 1069
12. B. Parhami An Introduction to Parallel Processing: Algorithms and Architectures 1999 Plenum Press New York
13. C.D. Park, and K.Y. Chwa Hamiltonian properties on the class of hypercube-like networks Inform. Process. Lett. 91 1 2004 11 17
14. J.H. Park, K.Y. Chwa, Recursive circulants: a new topology for multicomputer networks, in: Proc. 1994 Internat. Symp. on Parallel Architectures, Algorithms and Networks, 1994, pp. 73-80
15. J.H. Park, H.C. Kim, H.S. Lim, Fault-hamiltonicity of hypercube-like interconnection networks, in: Proc. of 19th IEEE Parallel and Distributed Processing Symposium, 2005, pp. 60-66
16. A.K. Somani, and O. Peleg On diagnosability of large fault sets in regular topology-based computer systems IEEE Trans. Comput. 45 8 1996 892 903
17. A.S. Vaidya, P.S.N. Rao, S.R. Shankar, A class of hypercube-like networks, in: Proc. 5th Symp. on Parallel and Distributed Processing, 1993, pp. 800-803
18. X. Yang, D.J. Evans, B. Chen, G.M. Megson, and H. Lai On the maximal connected component of hypercube with faulty vertices Internat. J. Comput. Math. 81 5 2004 515 525
19. X. Yang, D.J. Evans, and G.M. Megson On the maximal connected component of hypercube with faulty vertices (II) Internat. J. Comput. Math. 81 10 2004 1175 1185
20. X. Yang, D.J. Evans, and G.M. Megson The locally twisted cubes Internat. J. Comput. Math. 82 4 2005 401 413
21. X. Yang, D.J. Evans, and G.M. Megson Maximum induced subgraph of a recursive circulant Inform. Process. Lett. 95 1 2005 293 298