• DocumentCode
    2842541
  • Title

    The Pancyclicity of m-ary n-cube Networks

  • Author

    Hongmei, Liu

  • Author_Institution
    Three Gorges Univ., Hubei
  • fYear
    2007
  • fDate
    15-17 April 2007
  • Firstpage
    614
  • Lastpage
    617
  • Abstract
    m-ary n-cube (denoted by Qn(m)) is an important network topology for parallel processing computer systems. Some methods of forming big cycle from small cycles and links have been developed. Basing on which, we has proved that in m-ary n-cube, there exists a cycle of every length from 3 to |V(G)| inclusive and all kinds of length cycles have been constructed in. This important Hamilton property of m-ary n-cube can be applied in the topology design of computer networks to improve the network performance.
  • Keywords
    graph theory; hypercube networks; parallel processing; telecommunication network topology; Hamilton property; Pancyclic graph; computer network topology design; m-ary n-cube networks; network performance; pancyclicity; parallel processing computer system; Computer network reliability; Computer networks; Concurrent computing; Control systems; Distributed computing; Educational institutions; Joining processes; Network topology; Parallel processing; Telecommunication network reliability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking, Sensing and Control, 2007 IEEE International Conference on
  • Conference_Location
    London
  • Print_ISBN
    1-4244-1076-2
  • Electronic_ISBN
    1-4244-1076-2
  • Type

    conf

  • DOI
    10.1109/ICNSC.2007.372849
  • Filename
    4239062
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2842541