✦ LIBER ✦

Bounds on trees

✍ Scribed by Miodrag Sokić

Book ID: 108114286
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 257 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on isoperimetric values of trees

✍ B.V. Subramanya Bharadwaj; L. Sunil Chandran 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 467 KB

On upper bounds of bandwidths of trees

✍ Jianfang Wang; Bing Yao 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 349 KB

Sharp bounds on the eigenvalues of trees

✍ Shengbiao Hu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Let λ 1 (T ) and λ 2 (T ) be the largest and the second largest eigenvalues of a tree T , respectively. We obtain the following sharp lower bound for λ 1 (T ): where d i is the degree of the vertex v i and m i is the average degree of the adjacent vertices of v i . Equality holds if and only if T i

Bounds on the number of disjoint spannin

Bounds on the number of disjoint spanning trees

✍ Sukhamay Kundu 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Lower Bounds on Learning Decision Lists

Lower Bounds on Learning Decision Lists and Trees

✍ Thomas Hancock; Tao Jiang; Ming Li; John Tromp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Bounds on the convex label number of tre

Bounds on the convex label number of trees

✍ Marshall Bern; Alice Wong; Maria Klawe 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 650 KB