The bandwidth of a tree with k leaves is at most [k2]
โ Scribed by Kiyoshi Ando; Atsusi Kaneko; Severino Gervacio
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 171 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The bandwidth B(G) of a finite simple graph G is the minimum of the quantity max{ If(x)-f(Y)I:xyC E(G)} taken over all injective integer labellings f of G. We prove that if a tree T has k leaves then B(T)<~ [k/2~. This improves the previously known upper bound
B(T)<.IV(T)I/2
๐ SIMILAR VOLUMES
Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e
If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span
The reaction of the NH, radical with NO, NH2 +NO+k, products, was investigated using intracavity laser spectroscopy. The temperature dependence of k, [T) over the range 295-620 K is well approximated by the expression k, ( T) = (2,0? 0.4) X 1 O-'I x (T/298)-"' cm3 s-l. The branching ratios for the