The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) |
scientific article; zbMATH DE number 896017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) |
scientific article; zbMATH DE number 896017 |
Statements
The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (English)
0 references
17 February 1997
0 references
The bandwidth of a graph \(G = (V,E)\) is the minimum over all bijective functions \(f : B \to \{1, 2, \dots, |V |\}\), of \(\max \{|f(v) - f(w) |: \{v,w\} \in E\}\). This paper shows that a tree with \(k\) leaves has bandwidth at most \(\lceil k/2 \rceil\).
0 references
bandwidth
0 references
tree
0 references
0.8927469
0 references
0.87615144
0 references
0 references
0.86906236
0 references
0.8654632
0 references
0.83757555
0 references
