α-labeling number of trees

Chin Lin Shiue*, Hung-Lin Fu

*Corresponding author for this work

研究成果: Article

4 引文 斯高帕斯(Scopus)

摘要

In this paper, we prove that the α-labeling number of trees T, Tα ≤ ⌈ r / 2 ⌉ n where n = | E (T) | and r is the radius of T. This improves the known result Tα ≤ eO (sqrt(n log n)) tremendously and this upper bound is very close to the upper bound Tα ≤ n conjectured by Snevily. Moreover, we prove that a tree with n edges and radius r decomposes Kt for some t ≤ (r + 1) n2 + 1.

原文English
頁(從 - 到)3290-3296
頁數7
期刊Discrete Mathematics
306
發行號24
DOIs
出版狀態Published - 28 十二月 2006

指紋 深入研究「α-labeling number of trees」主題。共同形成了獨特的指紋。

  • 引用此