Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-27T12:03:50.782Z Has data issue: false hasContentIssue false
  • English
  • Français

A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS

Part of: Computer system organization Operations research and management science

Published online by Cambridge University Press:  02 March 2017

HAMID MOKHTAR
HAMID MOKHTAR*
Affiliation:
School of Mathematics and Statistics, The University of Melbourne, Victoria 3010, Australia email hmokhtar@student.unimelb.edu.au
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

Cayley graphcirculant graphcube-connected cycleinterconnection networkroutingshortest pathdiameterWiener indexedge-forwarding indexvertex-forwarding indexbisection width

MSC classification

Primary: 68M10: Network design and communication
Secondary: 90B18: Communication networks 90C27: Combinatorial optimization
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 95 , Issue 3 , June 2017 , pp. 518 - 520
Copyright
© 2017 Australian Mathematical Publishing Association Inc. 

References

Bermond, J. C., Comellas, F. and Hsu, D. F., ‘Distributed loop computer-networks: a survey’, J. Parallel Distrib. Comput. 24(1) (1995), 2–10.Google Scholar
Bermond, J. C., Gargano, L., Perennes, S., Rescigno, A. A. and Vaccaro, U., ‘Efficient collective communication in optical networks’, Theoret. Comput. Sci. 223 (2000), 165–189.Google Scholar
Gan, H.-S., Mokhtar, H. and Zhou, S., ‘Forwarding and optical indices of 4-regular circulant networks’, J. Discrete Algorithms 35(4) (2015), 27–39.CrossRefGoogle Scholar
Heydemann, M. C., Cayley Graphs and Interconnection Networks (Springer, Dordrecht, 1997).Google Scholar
Heydemann, M. C., Meyer, J. C. and Sotteau, D., ‘On forwarding indices of networks’, Discrete Appl. Math. 23(2) (1989), 103–123.Google Scholar
Lakshmivarahan, S., Jwo, J. S. and Dhall, S. K., ‘Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey’, Parallel Comput. 19(4) (1993), 361–407.Google Scholar
Mans, B. and Shparlinski, I., ‘Bisecting and gossiping in circulant graphs’, in: LATIN 2004: Theoretical Informatics, Proceedings of the 6th Latin American Symposium, Buenos Aires, Argentina, 2004 (ed. Farach-Colton, M.) (Springer, Berlin, 2004), 589–598.CrossRefGoogle Scholar
Mokhtar, H., ‘Cube-connected circulants: new efficient models for interconnection networks’, Preprint.Google Scholar
Mokhtar, H. and Zhou, S., ‘Recursive cubes of rings as models for interconnection networks’, Discrete Appl. Math. 217(3) (2017), 639–662.CrossRefGoogle Scholar
Sun, Y., Cheung, P. Y. S. and Lin, X., ‘Recursive cube of rings: a new topology for interconnection networks’, Parallel Distrib. Syst IEEE Trans. 11 (2000), 275–286.Google Scholar
Thomson, A. and Zhou, S., ‘Frobenius circulant graphs of valency four’, J. Aust. Math. Soc. 85 (2008), 269–282.CrossRefGoogle Scholar
Xu, J., Topological Structure and Analysis of Interconnection Networks, Network Theory and Applications, 7 (Springer, New York, 2013).Google Scholar