✦ LIBER ✦

The gracefulness of a class of lobster trees

✍ Scribed by J.-G. Wang; D.-J. Jin; X.-G. Lu; D. Zhang

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 393 KB
Volume: 20
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(94)00167-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The subdivision graph of a graceful tree

The subdivision graph of a graceful tree is a graceful tree

✍ M. Burzio; G. Ferrarese 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Koh, Rogers and Tan (Discrete Math. 25 (1979) [141][142][143][144][145][146][147][148] give a method to construct a bigger graceful tree from two graceful trees. Based upon their results, we give a new construction, which allows us to prove that the subdivision graph of a graceful tree is still a gr

Graceful lobsters obtained by partitioni

Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees

✍ D. Mishra; P. Panigrahi 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 852 KB

The joint sum of graceful trees

✍ De-Jun Jin; Si-Zhang Liu; Sang-Ho Lee; Hai-Lou Liu; Xi-Guan Lu; Dazhi Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 300 KB

In this and subsequent articles, we intend to explore Rosa's conjecture that every tree is graceful [l]. We define the concept of joint sum of graceful trees and study its operational properties. We shall prove the gracefulness of a certain family of trees. ## Keywords-tisak conjecture, Graceful

The radical product of graceful trees

✍ Si-Zhang Liu; De-Jun Jin; Sang-Ho Lee; Hai-Lou Liu; Xi-Guan Lu; Dazhi Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The cost of a class of optimal binary tr

The cost of a class of optimal binary trees

✍ Alan C Tucker 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).