Extensions of networks with given diameter (Q1123211)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4108814
Language Label Description Also known as
default for all languages
No label defined
    English
    Extensions of networks with given diameter
    scientific article; zbMATH DE number 4108814

      Statements

      Extensions of networks with given diameter (English)
      0 references
      0 references
      1989
      0 references
      The paper is motivated by some problems in the design of large interconnection networks. A D-admissible extension from a graph G to a graph \(G'\) is a sequence of graphs \(G=G_ 0,G_ 1,...,G_ k=G'\) such that \(G_ i\) is an induced subgraph of \(G_{i+1}\), \(| V(G_{i+1})| =| V(G_ i)| +1\) and all the \(G_ i\) have diameters at most D. There are constructed D-admissible extensions between hypercubes (from degree d to \(d+1\) and between de Bruijn networks.
      0 references
      connected graph
      0 references
      degree
      0 references
      diameters
      0 references
      hypercubes
      0 references
      de Bruijn networks
      0 references

      Identifiers