• DocumentCode
    1224913
  • Title

    Optimally Invulnerable Directed Communication Networks

  • Author

    Ayoub, Jamil N. ; Frisch, Ivan T.

  • Author_Institution
    COMSAT Lab., Clarksburg
  • Volume
    18
  • Issue
    5
  • fYear
    1970
  • fDate
    10/1/1970 12:00:00 AM
  • Firstpage
    484
  • Lastpage
    489
  • Abstract
    Algorithms are given to synthesize optimally invulnerable directed graphs with an arbitrary number of vertices and a minimum number of branches. We give a decomposition of these graphs into a class of subgraphs called step- l cycles, of which a directed Hamilton cycle is a special case. The use of this property in simultaneous k commodity flows is demonstrated.
  • Keywords
    Communication networks; Communications technology; Network synthesis; Strategic planning;
  • fLanguage
    English
  • Journal_Title
    Communication Technology, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9332
  • Type

    jour

  • DOI
    10.1109/TCOM.1970.1090418
  • Filename
    1090418
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1224913