• DocumentCode
    890924
  • Title

    On the structure of minimum communication overlap networks

  • Author

    Nieminen, Juhani

  • Author_Institution
    Dept. of Math., Oulu Univ., Finland
  • Volume
    35
  • Issue
    11
  • fYear
    1988
  • fDate
    11/1/1988 12:00:00 AM
  • Firstpage
    1465
  • Lastpage
    1467
  • Abstract
    The author simplifies the formula for counting the communication overlap Q(G) of an arbitrary graph and illuminates the structure of the minimum communication overlap graphs. He also presents a new communication overlap index Qq(G), gives a formula for counting the values of this index in the case of an arbitrary graph, and describes the structure of graphs with minimum value Qg(G)
  • Keywords
    graph theory; network topology; telecommunication networks; arbitrary graph; communication overlap index; minimum communication overlap networks; Communication networks; Joining processes; Permission;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.14477
  • Filename
    14477
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=890924