✦ LIBER ✦

The optimal pebbling number of the complete m-ary tree

✍ Scribed by Hung-Lin Fu; Chin-Lin Shiue

Book ID: 108315481
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 136 KB
Volume: 222
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00008-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The harmonious chromatic number of compl

The harmonious chromatic number of complete r-ary trees

✍ Keith Edwards 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Bandwidth of the complete k-ary tree

✍ Lawren Smithline 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 524 KB

We determine, constructively, the bandwidth of the complete k-ary tree on d levels. By rectifying an algorithm of Chung (1988), we establish B( Tk,J = rk(kd -1)/(2d( k -1)) 1. ## 1. Praeludium The bandwidth problem for a graph G is a question about numbering the vertices of G so the maximum differ

The Harmonious Chromatic Number of Deep

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees

✍ John Mitchem; Ed Schmeichel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 409 KB

On the Number of t-Ary Trees with a Give

On the Number of t-Ary Trees with a Given Path Length

✍ Gadiel Seroussi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 190 KB

The Sizes of Optimal -Ary Codes of Weigh

The Sizes of Optimal -Ary Codes of Weight Three and Distance Four: A Complete Solution

✍ Yeow Meng Chee; Son Hoang Dau; Ling, A.C.H.; San Ling 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 242 KB

The harmonious chromatic number of a com

The harmonious chromatic number of a complete binary and trinary tree

✍ Zhikang Lu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Lu, Z., The harmonious chromatic number of a complete binary and trinary tree, Discrete Mathematics 118 (1993) 1655172.