The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4039999 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5596082 / rank | |||
Normal rank | |||
Latest revision as of 13:00, 24 May 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
