Strategies for interconnection networks: Some methods from graph theory

Akers, 1965, On the construction of (d, k) graphs, IEEE Trans. Electron Comput., EC-14, 488, 10.1109/PGEC.1965.264176 Alegre, 1986, Some large graphs with given degree and diameter, J. Graph Theory, 10, 219, 10.1002/jgt.3190100211 Arden, 1982, A regular network for multicomputer systems, IEEE Trans. Comput., C-31, 60, 10.1109/TC.1982.1675886 Berge, 1973 Bermond, 1983, Graphs and interconnection networks: Diameter and vulnerability, Vol 82, 1 Bermond, 1986, Bus interconnection networks with each station on two buses Bermond, 1984, Large hypergraphs of diameter 1, 19 Bermond, 1984, Large graphs with given degree and diameter, II, J. Combin. Theory Ser. B, 36, 32, 10.1016/0095-8956(84)90012-1 Bermond, 1981, Large graphs with given degree and diameter, III Bermond, 1982, Ann Discrete Math., 13, 23 Bermond, 1982, Tables of large graphs with given degree and diameter, Inform. Process. Lett., 15, 10, 10.1016/0020-0190(82)90076-X Bermond, 1983, Grands graphes de degré et diamètre fixés, Ann. Discrete Math., 17, 65 Bermond, 1986, Large fault-tolerant interconnection networks Biggs, 1974, Algebraic Graph Theory, 10.1017/CBO9780511608704 Bond, 1984, Construction de grands graphes d'interconnexions Brouwer, A. E., and Wilbrink, H. A. Private communication, Jan. 1982. de Bruijn, 1946, A combinatorial problem, 49, 758 Carlsson, 1985, Interconnection networks based on a generalization of cube-connected cycles, IEEE Trans. Comput., C-34, 769, 10.1109/TC.1985.1676627 Chung, 1985, Sparse graphs with small diameters Chung, 1986, Diameter of communication networks, Vol. 34, 1 von Conta, 1983, Torus and other networks as communication networks with up to some hundred points, IEEE Trans. Comput., C-32, 657, 10.1109/TC.1983.1676297 Delorme, 1984, Two notes on large graphs Delorme, 1985, Grands graphes de degré et diamètre donnés, J. Européen Combin., 6, 291, 10.1016/S0195-6698(85)80043-3 Delorme, 1985, Large bipartite graphs with given degree and diameter, J. Graph Theory, 9, 325, 10.1002/jgt.3190090304 Delorme, 1984, Large graphs with given degree and diameter, I, IEEE Trans. Comput., C-33, 857, 10.1109/TC.1984.1676504 Delorme, 1984 Doty, 1982, Large regular interconnection networks, 312 Doty, K. W. Dense bus connection networks. Proc. IEEE 1983 Int. Conf. on Parallel Processing, pp. 158–160. Doty, 1984, New design for dense processor interconnection networks, IEEE Trans. Comput., C-33, 447, 10.1109/TC.1984.1676461 Elspas, 1964, Topological constraints on interconnection-limited logic, IEEE S-164, 133 Erdös, 1980, Maximum degree in graphs of diameter 2, Networks, 10, 87, 10.1002/net.3230100109 Feng, 1981, A survey of interconnection networks, Computer, 14, 12, 10.1109/C-M.1981.220290 Finkel, 1981, The lens interconnection strategy, IEEE Trans. Comput., C-30, 960, 10.1109/TC.1981.1675735 Fiol, 1983, Line digraph iterations and the (d, k) problem for directed graphs, 174 Fiol, 1983, Algunos grafos compuestas, Stochastica, 7, 137 Fiol, 1984, Line digraph iterations and the (d, k) digraph problem, IEEE Trans. Comput., C-33, 400, 10.1109/TC.1984.1676455 Fiol, 1985, Sequence graphs and interconnection networks, 16-A, 7 Gómez, 1986, Diametro y vulnerabilidad en redes de interconexión Gómez, 1985, Dense compound graphs, 20-A, 211 Gómez, J., Fiol, M. A., and Yebra, J. L. A. Graphs on alphabets as models for large computer networks. Submitted for publication. Hoffman, 1960, On Moore graphs with diameter 2 and 3, IBM J. Res. Develop., 4, 497, 10.1147/rd.45.0497 Imase, 1981, Design to minimize diameter on building-block network, IEEE Trans. Comput., C-30, 439, 10.1109/TC.1981.1675809 Imase, 1983, A design for directed graphs with minimum diameter, IEEE Trans. Computers, C-32, 782, 10.1109/TC.1983.1676323 Jerrum, 1984, Families of fixed degree graphs for processor interconnection, IEEE Trans. Comput., C-33, 190, 10.1109/TC.1984.1676410 Kautz, 1968, Bounds on directed (d, k) graphs, 20 Leland, 1981, High density graphs for processor interconnection, Inform. Process. Lett., 12, 117, 10.1016/0020-0190(81)90107-1 Memmi, 1982, Some new results about the (d, k) graph problem, IEEE Trans. Comput., C-31, 784, 10.1109/TC.1982.1676084 Peterson, G. L., and Ting, Y. -H. Trade-offs in VLSI for bus communication networks. In 1982–1983 Computer Science and Computer Engineering Research Review. University of Rochester, Rochester, N. Y., pp. 23–32. Quisquater, J. -J. New constructions of large graphs with fixed degree and diameter. To appear. Ralston, 1982, de Bruijn sequences. A model example of the interaction of discrete mathematics on the computer science, Math. Mag., 55, 131, 10.2307/2690079 Reddy, 1982, On digraphs with minimum diameter and maximum connectivity, 1018 Storwick, 1970, Improved construction techniques for (d, k) graphs, IEEE Trans. Comput., C-19, 1214, 10.1109/T-C.1970.222861 Uhr, 1981, Compounding denser (d, k) graph architectures for computer networks. Uhr, 1984 Wegner, 1976 Wittie, 1981, Communication structures for large networks of microcomputers, IEEE Trans. Comput., C-30, 264, 10.1109/TC.1981.1675774 Wittie, 1980, MICROS, a distributed operating system for MICRONET, a reconfigurable network computer, IEEE Trans. Comput., C-29, 1133, 10.1109/TC.1980.1675518 Wu, 1984