The L(2, 1)-labeling problem on ditrees

Gerard J. Chang, Sheng Chyang Liaw

研究成果: 雜誌貢獻期刊論文同行評審

20 引文 斯高帕斯(Scopus)


An L(2, 1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x) - f(y)| ≥ 2 if d G(x, y) = 1 and |f(x) - f(y)| ≥ 1 if dG(x, y) = 2. The L(2, 1)-labeling problem is to find the smallest number λ(G) such that there exists a L(2, 1)-labeling function with no label greater than λ(G). Motivated by the channel assignment problem introduced by Hale, the L(2, 1)-labeling problem has been extensively studied in the past decade. In this paper, we study this concept for digraphs. In particular, results on ditrees are given.

頁(從 - 到)23-31
期刊Ars Combinatoria
出版狀態已出版 - 1月 2003


深入研究「The L(2, 1)-labeling problem on ditrees」主題。共同形成了獨特的指紋。