Extensions of networks with given diameter
type: Item
instance of: scholarly article
title: Extensions of networks with given diameter
zbMATH Open document ID: 0677.05052
DOI: 10.1016/0012-365X(89)90075-7
author: S. H. Smith
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 4108814
zbMATH Keywords: connected graph
zbMATH Keywords: degree
zbMATH Keywords: diameters
zbMATH Keywords: hypercubes
zbMATH Keywords: de Bruijn networks
reviewed by: Jiří Rosický
MaRDI profile type: Publication
cites work: Q3039368
cites work: Q5834367
cites work: On the Decomposition of Graphs
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
full work available at URL: 0012-365x(89)90075-7
OpenAlex ID: W1963772034
description: scientific article; zbMATH DE number 4108814