๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Building Cartesian trees from free trees with k leaves

โœ Scribed by Dean, Brian C.; Mohan, Raghuveer

Book ID
122581636
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
185 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Intersection representation of digraphs
Intersection representation of digraphs in trees with few leaves
โœ Lin, In-Jen; Sen, Malay K.; West, Douglas B. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 285 KB ๐Ÿ‘ 2 views

The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp inequalities.

The bandwidth of a tree with k leaves is
The bandwidth of a tree with k leaves is at most [k2]
โœ Kiyoshi Ando; Atsusi Kaneko; Severino Gervacio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

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