The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q242851 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
Normal rank | |||
Revision as of 18:30, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) |
scientific article |
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
