Extensions of networks with given diameter

DOI10.1016/0012-365X(89)90075-7MaRDI QIDQ1123211zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(89)90075-7

zbMATH Keywords

connected graphde Bruijn networksdegreediametershypercubes

Mathematics Subject Classification ID

Connectivity (05C40)

Review text

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.

Recommendations

• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• scientific article; zbMATH DE number 2040828
• scientific article; zbMATH DE number 3891413
• Connections between two cycles --- a new design of dense processor interconnection networks
• scientific article; zbMATH DE number 3859160

Cites work

• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• On the Decomposition of Graphs

Cited in

(3)

• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• scientific article; zbMATH DE number 653272 (Why is no real title available?)

This page was built for publication: Extensions of networks with given diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123211)