✦ 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
DOI: 10.1007/bf02366543

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular algebra of functionals of labele

Regular algebra of functionals of labeled trees

✍ L. P. Lisovik 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 741 KB

On the largest eigenvalues of trees with

On the largest eigenvalues of trees with perfect matchings

✍ Wenshui Lin; Xiaofeng Guo 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 217 KB

Perfect pairs of trees associated with a

Perfect pairs of trees associated with a prescribed tree: An algorithmic approach

✍ Ladislav Novak; Alan Gibbons 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

On the th Laplacian eigenvalues of trees

On the th Laplacian eigenvalues of trees with perfect matchings

✍ Jianxi Li; Wai Chee Shiu; An Chang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the Laplacian spectral radii of trees

On the Laplacian spectral radii of trees with perfect matchings

✍ Xi-Ying Yuan; Jia-Yu Shao; Chang-Xiang He 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 334 KB

Bipartite labeling of trees with maximum

Bipartite labeling of trees with maximum degree three

✍ 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