• DocumentCode
    1192440
  • Title

    The minimum order of n-connected n-regular graphs with specified diameters

  • Author

    Bhattacharya, Debashis

  • Volume
    32
  • Issue
    4
  • fYear
    1985
  • fDate
    4/1/1985 12:00:00 AM
  • Firstpage
    407
  • Lastpage
    409
  • Abstract
    In this paper, an exact formula for the order of a minimum (d, n, n) -graph, for any n and d , is derived, and an algorithm to construct a class of minimum (d, n, n) -graphs is presented. For the case n = 3 , this formula yields the result obtained by Myers for the order of minimum (d, 3,3) -graphs.
  • Keywords
    Graph theory; Circuits; Fault tolerance; Partitioning algorithms; Terminology;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1985.1085709
  • Filename
    1085709
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1192440