✦ LIBER ✦

UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE

✍ Scribed by Henning, Michael A.

Book ID: 118205421
Publisher: Taylor and Francis Group
Year: 1998
Tongue: English
Weight: 542 KB
Volume: 21
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1998.9632043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the Ramsey number of t

An upper bound on the Ramsey number of trees

✍ András Gyárfás; Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

An upper bound on the total restrained d

An upper bound on the total restrained domination number of a tree

✍ Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 529 KB

An upper bound on the 2-outer-independen

An upper bound on the 2-outer-independent domination number of a tree

✍ Marcin Krzywkowski 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Lower and upper bounds for the number of

Lower and upper bounds for the number of critical points on energy hypersurfaces

✍ Paul G. Mezey 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Lower and upper bounds for the number of

Lower and upper bounds for the number of critical points on energy hypersurfaces

✍ P.G. Mezey 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 38 KB

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

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