• DocumentCode
    3296976
  • Title

    Representations of Borel Cayley graphs

  • Author

    Tang, K. Wendy ; Arden, Bruce W.

  • Author_Institution
    Dept. of Electr. Eng., State Univ. of New York, Stony Brook, NY, USA
  • fYear
    1992
  • fDate
    19-21 Oct 1992
  • Firstpage
    194
  • Lastpage
    201
  • Abstract
    It is shown that all degree-4 Borel Cayley graphs can also be represented by more restrictive chordal rings (CRs) through a constructive proof. All bidirectional, degree-4 Borel Cayley graphs have the more restrictive CR representations, and hence Hamiltonian cycles always exist for these graphs. A step-by-step algorithm to transform any degree-4 Borel Cayley graph into CR graphs is provided. Examples are used to illustrate this concept
  • Keywords
    multiprocessor interconnection networks; parallel algorithms; Borel Cayley graphs; Hamiltonian cycles; restrictive chordal rings; step-by-step algorithm; Chromium; Concurrent computing; Delay; Joining processes; Routing; Sufficient conditions; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
  • Conference_Location
    McLean, VA
  • Print_ISBN
    0-8186-2772-7
  • Type

    conf

  • DOI
    10.1109/FMPC.1992.234888
  • Filename
    234888
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3296976