Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-25T05:07:08.768Z Has data issue: false hasContentIssue false
  • English
  • Français

TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

Part of: Operations research and management science Graph theory

Published online by Cambridge University Press:  13 January 2010

GUILLERMO PINEDA-VILLAVICENCIO
GUILLERMO PINEDA-VILLAVICENCIO*
Affiliation:
Centre for Informatics and Applied Optimization, University of Ballarat, University Drive, Mount Helen, Victoria 3353, Australia (email: [email protected])
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

graphinterconnection network

MSC classification

Secondary: 05C50: Graphs and linear algebra (matrices, eigenvalues, etc.) 05C75: Structural characterization of families of graphs 05C76: Graph operations (line graphs, products, etc.) 90C27: Combinatorial optimization 90B18: Communication networks
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 81 , Issue 2 , April 2010 , pp. 350 - 352
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2010

References

[1]Bannai, E. and Ito, T., ‘On finite Moore graphs’, J. Math. Sci. Univ. Tokyo 20 (1973), 191–208.Google Scholar
[2]Biggs, N. L., Algebraic Graph Theory, 2nd edn (Cambridge University Press, Cambridge, 1993).Google Scholar
[3]Delorme, C., Jørgensen, L. K., Miller, M. and Pineda-Villavicencio, G., ‘On bipartite graphs of defect 2’, European J. Combin. 30(4) (2009), 798–808.CrossRefGoogle Scholar
[4]Delorme, C., Jørgensen, L. K., Miller, M. and Pineda-Villavicencio, G., ‘On bipartite graphs of diameter 3 and defect 2’, J. Graph Theory 61(4) (2009), 271–288.CrossRefGoogle Scholar
[5]Exoo, G. and Jajcay, R., ‘Dynamic cage survey’, Electron. J. Combin. (2008), 1–48. Dynamic survey DS16.Google Scholar
[6]Feit, W. and Higman, G., ‘The nonexistence of certain generalized polygons’, J. Algebra 1 (1964), 114–131.CrossRefGoogle Scholar
[7]Miller, M. and Pineda-Villavicencio, G., ‘Complete catalogue of graphs of maximum degree 3 and defect at most 4’, Discrete Appl. Math. 157(13) (2009), 2983–2996.CrossRefGoogle Scholar
[8]Miller, M. and Širáň, J., ‘Moore graphs and beyond: a survey of the degree/diameter problem’, Electron. J. Combin. (2005), 1–61. Dynamic survey DS14.CrossRefGoogle Scholar
[9]Pineda-Villavicencio, G., ‘Non-existence of bipartite graphs of diameter at least 4 and defect 2’, submitted.Google Scholar
[10]Pineda-Villavicencio, G., Gómez, J., Miller, M. and Pérez-Rosés, H., ‘New largest known graphs of diameter 6’, Networks 53(4) (2009), 315–328.CrossRefGoogle Scholar
[11]Pineda-Villavicencio, G. and Miller, M., ‘On graphs of maximum degree 3 and defect 4’, J. Combin. Math. Combin. Comput. 65 (2008), 25–31.Google Scholar
[12]Singleton, R. C., ‘On minimal graphs of maximum even girth’, J. Combin. Theory 1(3) (1966), 306–332.CrossRefGoogle Scholar