• DocumentCode
    1498966
  • Title

    Graph theoretic reliability analysis for the Boolean n cube networks

  • Author

    Yang, C.S. ; Wang, J.F. ; Lee, J.Y. ; Boesch, F.T.

  • Author_Institution
    Nat. Cheng Kung Univ., Tainan, Taiwan
  • Volume
    35
  • Issue
    9
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1175
  • Lastpage
    1179
  • Abstract
    Two graph-theoretic results concerning Boolean n-cube network reliability are presented. First, a simple formula for the number of spanning trees of the Boolean n-cube network is derived. As a result, the reliability function for large failure rate can be readily computed. Second, the Boolean n-cube network is proved to have the super-line-connectivity property. Thus the number of line-disconnecting sets (a set of lines the removal of which results in a disconnected or trivial graph) or order λ for the Boolean n -cube network is equal to 2n
  • Keywords
    Boolean functions; failure analysis; graph theory; multiprocessor interconnection networks; reliability theory; telecommunication networks; trees (mathematics); Boolean n-cube network; computer network design; failure rate; graph-theoretic results; reliability analysis; spanning trees; super-line-connectivity property; Books; Circuits and systems; Computer network reliability; Integrated circuit interconnections; Joining processes; Reliability theory; Terminology; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.7582
  • Filename
    7582
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1498966