This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Small Diameter Symmetric Networks From Linear Groups
February 1992 (vol. 41 no. 2)
pp. 218-220

A report is presented on a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation.

[1] F. Annexstein, M. Baumslag, and A. L. Rosenberg, "Group action graphs and parallel architectures,"COINS Tech. Rep. 87-133, Univ. of Massachusetts, Amherst, MA, 1987.
[2] S. B. Akers and B. Krishnamurthy, "On group graphs and their faulttolerance,"IEEE Trans. Comput., vol. C-36, pp. 885-888, 1987.
[3] J. C. Bermond, C. Delorme, and J. J. Quisquater, "Strategies for interconnection networks: Some methods from graph theory,"J. Parallel and Distributed Comput., vol. 3, pp. 433-449, 1986.
[4] J. Bond, C. Delorme, and W. F. de La Vega, "Large Cayley graphs with small degree and diameter," Rapport de Recherche no. 392, LRI, Orsay, France, 1987.
[5] J. C. Bermond, private communication, June 1989.
[6] R. Bar-Yehuda and T. Etzion, "Connections between two cycles--A new design of dense processor interconnection networks," Tech. Rep. 528, Dep. Comput. Sci., Technion, Haifa, Israel, 1988.
[7] N. Biggs,Algebraic Graph Theory. London, England: Cambridge University Press, 1974.
[8] D. V. Chudnovsky, G. V. Chudnovsky, and M. M. Denneau, "Regular graphs with small diameter as models for interconnection networks," inProc. Third Int. Conf. Supercomput., Boston, MA, May 1988, pp. 232-239.
[9] F. R. K. Chung, "Diameters of graphs: Old problems and new results,"Congressus Numerantium 60, pp. 295-317, 1987.
[10] 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., vol. C-34, pp. 769-777, 1985.
[11] V. Faber, "Global communication algorithms for hypercubes and other Cayley coset graphs," Tech. Rep., Los Alamos National Lab., Los Alamos, NM, 1988.
[12] M. Fellows, "A category of graphs for parallel processing," Tech. Rep. Dep. Comput. Sci., Univ. of Idaho, Moscow, ID, 1988.

Index Terms:
linear groups; symmetric networks; nodes; Cayley graphs; graph theory; group theory; multiprocessor interconnection networks.
Citation:
L. Campbell, G.E. Carlsson, M.J. Dinneen, V. Faber, M.R. Fellows, M.A. Langston, J.W. Moore, A.P. Mullhaupt, H.B. Sexton, "Small Diameter Symmetric Networks From Linear Groups," IEEE Transactions on Computers, vol. 41, no. 2, pp. 218-220, Feb. 1992, doi:10.1109/12.123397
Usage of this product signifies your acceptance of the Terms of Use.