• DocumentCode
    3445028
  • Title

    Wide Diameter of Cayley Digraphs of Finite Cyclic Groups

  • Author

    Jia, Xingde

  • Author_Institution
    Dept. of Math., Texas State Univ., San Marcos, TX
  • fYear
    2008
  • fDate
    7-9 May 2008
  • Firstpage
    146
  • Lastpage
    150
  • Abstract
    According to recent studies, communication networks built on extremal Cayley digraphs of finite cyclic groups have many advantages over that based on n-cubes. Extremal Cayley digraphs have been studied extensively in recent years. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley digraph Cay(Zm, A) is at most diam(Cay(Zm, A)) + 1 if A is an "m-ideal" set of k positive integers.
  • Keywords
    directed graphs; group theory; network theory (graphs); telecommunication networks; Cayley digraph wide diameter; communication network; finite cyclic group; Bandwidth; Communication networks; Containers; Mathematics; Parallel architectures; Cayley digraphs; communication networks; geometric representation; wide diameter;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures, Algorithms, and Networks, 2008. I-SPAN 2008. International Symposium on
  • Conference_Location
    Sydney, NSW
  • ISSN
    1087-4089
  • Print_ISBN
    978-0-7695-3125-0
  • Type

    conf

  • DOI
    10.1109/I-SPAN.2008.19
  • Filename
    4520208
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3445028