Extensions of networks with given diameter (Q1123211): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(89)90075-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963772034 / rank
 
Normal rank

Latest revision as of 09:19, 30 July 2024

scientific article
Language Label Description Also known as
English
Extensions of networks with given diameter
scientific article

    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