Generalized diameters of the mesh of trees

Theory of Computing Systems

Volumn 37, Issue 4, 2004, Pages 547-556

  Chen, Wei Mei ^a   Chen, Gen Huey ^b   Hsu, D Frank ^c  

^a TATUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c FORDHAM UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPHS; PACKET ROUTING; SPANNING TREES;

COMPUTATIONAL METHODS; CONVOLUTION; INTERCONNECTION NETWORKS; MATRIX ALGEBRA; NUMBER THEORY; PACKET NETWORKS; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 3543013746     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1115-0     Document Type: Article

References (17)

1. B. Bollobas, Extremal Graph Theory, Academic Press, New York, 1978.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.
3. F. Cao, D. Z. Du, D. F. Hsu, and S. H. Teng, Fault tolerance properties of pyramid networks, IEEE Transactions on Computers, vol. 48, no. 1, pp. 88-93, 1999.
4. K. Day and A. E. Al-Ayyoub, Fault diameter of k-ary n-cube networks, IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 9, pp. 903-907, 1997.
5. M. Dietzfelbinger, S. Madhavapeddy, and I. H. Sudborough, Three disjoint path paradigms in star networks, Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 400-406.
6. D. R. Duh and G. H. Chen, Topological properties of WK-recursive networks, Journal of Parallel and Distributed Computing, vol. 23, no. 3, pp. 468-474, 1994.
7. D. R. Duh and G. H. Chen, On the Rabin number problem, Networks, vol. 30, no. 3, pp. 219-230, 1997.
8. D. F. Hsu, On container width and length in graphs, groups, and networks, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, vol. E77-A, no. 4, pp. 668-680, 1994.
9. D. F. Hsu and Y. D. Lyuu, A graph-theoretical study of transmission delay and fault tolerance, International Journal of Mini and Microcomputers, vol. 16, pp. 35-42, 1994.
10. M. S. Krishnamurthy and B. Krishnamurthy, Fault diameter of interconnection networks, Computers and Mathematics with Applications, vol. 13, no. 5-6, pp. 577-582, 1987.
11. S. Latifi, On the fault-diameter of the star graph, Information Processing Letters, vol. 46, no. 3 pp. 243-251, 1993.
12. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
13. S. C. Liaw and G. J. Chang, Generalized diameters and Rabin numbers of networks, Journal of Combinatorial Optimization, vol. 2, no. 4, pp. 371-384, 1999.
14. S. C. Liaw, G. J. Chang, F. Cao, and D. F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Annals of Combinatorics, vol. 2, pp. 165-172, 1998.
15. M. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335-348, 1989.
16. Y. Rouskov and P. Srimani, Fault diameter of star graphs, Information Processing Letters, vol. 48, pp. 234-251, 1993.
17. Y. Saad and M. H. Schultz, Topological properties of hypercubes, IEEE Transactions on Computers, vol. 37, no. 7, pp. 867-972, 1988.