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

Recognition of perfect labeled trees with regularity condition

โœ Scribed by L. P. Lisovik


Publisher
Springer US
Year
1996
Tongue
English
Weight
167 KB
Volume
32
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Bipartite labeling of trees with maximum
โœ Bonnington, C. Paul; ?ir๏ฟฝ?, Jozef ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB ๐Ÿ‘ 3 views

Let T = (V, E) be a tree with a properly 2-colored vertex set. A bipartite labeling of T is a bijection ฯ•: V โ†’ {1, . . . , |V |} for which there exists a k such that whenever ฯ•(u) โ‰ค k < ฯ•(v), then u and v have different colors. The ฮฑ-size ฮฑ(T ) of the tree T is the maximum number of elements in the