• DocumentCode
    1151052
  • Title

    Large Graphs with Given Degree and Diameter—Part I

  • Author

    Delorme, Charles ; Farhi, G.

  • Author_Institution
    Department of Mathematics, University Paris-Sud
  • Issue
    9
  • fYear
    1984
  • Firstpage
    857
  • Lastpage
    860
  • Abstract
    The following problem arises in the study of interconnection networks: find graphs of given diameter and degree having the maximum number of vertices. In this correspondence we give some constructions of graphs proving in particular that lim△∞inf N(△, D).△-D ≥ 2-D, where N(△, D) is the maximum number of vertices of a graph with degree A and diameter D.
  • Keywords
    (d, k)-graph problem; interconnection networks; regular networks; undirected graphs; Automation; Mathematics; Microprocessors; Modular construction; Multiprocessor interconnection networks; (d, k)-graph problem; interconnection networks; regular networks; undirected graphs;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1984.1676504
  • Filename
    1676504
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1151052