Bandwidth of the complete \(k\)-ary tree
type: Item
instance of: scholarly article
title: Bandwidth of the complete \(k\)-ary tree
zbMATH Open document ID: 0827.05050
DOI: 10.1016/0012-365X(93)E0219-T
author: Lawren Smithline
published in: Discrete Mathematics
publication date: 1995-08-27T00:00:00Z
review text: The author succeeds in determining the bandwidth \(B(T_{k,d})\) of the complete \(k\)-ary tree \(T_{k,d}\) on \(d\) levels, \(k,d\in \mathbb{N}\). The proof is constructive and done by rectifying a known algorithm of Chung (1988).
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 790761
zbMATH Keywords: bandwidth
zbMATH Keywords: complete \(k\)-ary tree
zbMATH Keywords: algorithm of Chung
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q3803160
Wikidata QID: Q127098633
description: scientific article; zbMATH DE number 790761