• DocumentCode
    2363146
  • Title

    A model for constructing subgraphs of hypercubes

  • Author

    Oluwade, Dele

  • Author_Institution
    Univ. of Ibadan, Ibadan
  • fYear
    2007
  • fDate
    26-28 Sept. 2007
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    Network topologies play an important role in computer communication networks. Apart from the basic topologies, some other new topologies have been proposed in the literature such as the hypercubes, meshes and trees. In this paper, a model for constructing subgraphs of hypercubes using the qualitative equivalence behavior of the first order autonomous ordinary differential equation x´ = f(x) ( where f(x) is a polynomial of degree n) is presented. The resulting topologies are based on the point-to-point primitive network topology. The topologies of particular interest are those which arise when the critical points of the above equation are complex.
  • Keywords
    differential equations; graph theory; hypercube networks; network theory (graphs); telecommunication network topology; computer communication networks; first order autonomous ordinary differential equation; hypercubes; network topologies; subgraph construction; Communication networks; Computer networks; Differential equations; Fault tolerance; Hypercubes; Labeling; Local area networks; Network topology; Polynomials; Routing; Hypercube; model; network topologies; ordinary differential equation; subgraph;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    AFRICON 2007
  • Conference_Location
    Windhoek
  • Print_ISBN
    978-1-4244-0987-7
  • Electronic_ISBN
    978-1-4244-0987-7
  • Type

    conf

  • DOI
    10.1109/AFRCON.2007.4401481
  • Filename
    4401481