✦ LIBER ✦

-labeling of the infinite regular trees

✍ Scribed by Duan, Ziming; Miao, Lianying; Wang, Cuiqi; Miao, Zhengke

Book ID: 121217113
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 381 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.06.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular algebra of functionals of labele

Regular algebra of functionals of labeled trees

✍ L. P. Lisovik 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 741 KB

The Borel hierarchy is infinite in the c

The Borel hierarchy is infinite in the class of regular sets of trees

✍ Jerzy Skurczyński 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Recognition of perfect labeled trees wit

Recognition of perfect labeled trees with regularity condition

✍ L. P. Lisovik 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 167 KB

The minimum labeling spanning trees

✍ Ruay-Shiung Chang; Leu Shing-Jiuan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 449 KB

One of the fundamental problems in graph theory is to compute a minimum weight spanning tree. In this paper, a variant of spanning trees, called the minimum labeling spanning tree, is studied. The purpose is to find a spanning tree that tries to use edges that are as similar as possible. Giving each

The Automorphism Groups of Regular Trees

✍ Moller, R. G. 📂 Article 📅 1991 🏛 Oxford University Press 🌐 English ⚖ 398 KB

Anti-magic labeling of trees

✍ Liang, Yu-Chang; Wong, Tsai-Lien; Zhu, Xuding 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 394 KB