On the Bisection Width of the Transposition Network

Networks

Volumn 29, Issue 1, 1997, Pages 69-76

  Kalpakis, Konstantinos ^a   Yesha, Yaacov ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347770176     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199701)29:1<69::AID-NET7>3.0.CO;2-A     Document Type: Article

References (19)

1. S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks. IEEE Trans. on Comput. 38(4) (1989) 555-566.
2. C. Berge, Principles of Combinatorics. Mathematics in Science and Engineering, Vol. 72. Academic Press, New York (1971).
3. C. Berge, Graphs and Hypergraphs. North-Holland Mathematical Library, Vol. 6. American Elsevier, New York (1973).
4. G. E. Carlsson, J. E. Cruthirds, H. B. Sexton, and C. G. Wright, Interconnection networks based on a generalization of cube-connected cycles. IEEE Trans. Comput. 34(8) (1985) 769-772.
5. N. Biggs, Algebraic Graph Theory. Cambridge University Press, New York (1974).
6. C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras. Pure and Applied Mathematics, Vol. XI. Wiley, New York (1962).
7. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs. Pure and Applied Mathematics, Vol. 87. Academic Press, New York (1979).
8. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979).
9. C. D. Godsil and B. D. McKay, Feasibility conditions for the existence of walk-regular graphs. Linear Alg. Appl. 30 (1980) 51-61.
10. I. N. Herstein, Topics in Algebra, 2nd ed. Wiley, New York (1975).
11. V. L. Komepel'makher and V. A. Liskovets, Sequential generation of arrangements by means of a basis of trans-positions. Kibernetica 3 (1975) 17-21.
12. F. T. Leighton, New lower bound techniques for VLSI. Math. Syst. Theory 17 (1984) 47-70.
13. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA (1992).
14. F. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, IEEE (1988) 422-431.
15. B. Mohar, Isoperimetric numbers of graphs. J. Combin. Theory, Ser. B 47 (1989) 274-291.
16. B. Mohar, Laplace eigenvalues of graphs - A survey. Discr. Math. 109 (1992) 171-183.
17. B. Mohar and S. Poljak, Eigenvalues in combinatorial optimization. Combinatorial and Graph-Theoretical Problems in Linear Algebra. (R. A. Brualdi, S. Friedland, and V. Klee, Eds.) Springer-Verlag, New York (1993) 107-151.
18. F. D. Murnaghan, The Theory of Group Representations. Dover, New York (1938).
19. P. Zieschang, Cayley graphs of finite groups. J. Algebra 118 (1988) 447-454.