Skip to main content Accessibility help
×
Home

TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

  • GUILLERMO PINEDA-VILLAVICENCIO (a1)
    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
      Available formats
      ×

Abstract

  • An abstract is not available for this content so a preview has been provided below. To view the full text please use the links above to select your preferred format.

Copyright

References

Hide All
[1]Bannai, E. and Ito, T., ‘On finite Moore graphs’, J. Math. Sci. Univ. Tokyo 20 (1973), 191208.
[2]Biggs, N. L., Algebraic Graph Theory, 2nd edn (Cambridge University Press, Cambridge, 1993).
[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), 798808.
[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), 271288.
[5]Exoo, G. and Jajcay, R., ‘Dynamic cage survey’, Electron. J. Combin. (2008), 148. Dynamic survey DS16.
[6]Feit, W. and Higman, G., ‘The nonexistence of certain generalized polygons’, J. Algebra 1 (1964), 114131.
[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), 29832996.
[8]Miller, M. and Širáň, J., ‘Moore graphs and beyond: a survey of the degree/diameter problem’, Electron. J. Combin. (2005), 161. Dynamic survey DS14.
[9]Pineda-Villavicencio, G., ‘Non-existence of bipartite graphs of diameter at least 4 and defect 2’, submitted.
[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), 315328.
[11]Pineda-Villavicencio, G. and Miller, M., ‘On graphs of maximum degree 3 and defect 4’, J. Combin. Math. Combin. Comput. 65 (2008), 2531.
[12]Singleton, R. C., ‘On minimal graphs of maximum even girth’, J. Combin. Theory 1(3) (1966), 306332.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Keywords

MSC classification

TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

  • GUILLERMO PINEDA-VILLAVICENCIO (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed