✦ LIBER ✦

The joint sum of graceful trees

✍ Scribed by De-Jun Jin; Si-Zhang Liu; Sang-Ho Lee; Hai-Lou Liu; Xi-Guan Lu; Dazhi Zhang

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 300 KB
Volume: 26
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90027-s

No coin nor oath required. For personal study only.

✦ Synopsis

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 trees, Joint sum of graceful trees, Glue trees.

📜 SIMILAR VOLUMES

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 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

The gracefulness of a class of lobster t

The gracefulness of a class of lobster trees

✍ J.-G. Wang; D.-J. Jin; X.-G. Lu; D. Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 393 KB

On the general sum-connectivity index of

On the general sum-connectivity index of trees

✍ Zhibin Du; Bo Zhou; Nenad Trinajstić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 226 KB

The general sum-connectivity index of a graph G is defined as , where d u denotes the degree of vertex u in G, E(G) denotes the edge set of G, and α is a real number. We determine the maximum value for the general sum-connectivity indices of n-vertex trees and the corresponding extremal trees for α

On the joint distribution of digital sum

On the joint distribution of digital sums

✍ Jerome A. Solinas 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Coloring of trees with minimum sum of co

Coloring of trees with minimum sum of colors

✍ Jiang, Tao; West, Douglas B. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k -2. The result