Distance-two labelings of digraphs

Gerard J. Chang, Jer Jeong Chen, David Kuo, Sheng Chyang Liaw

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

13 引文 斯高帕斯(Scopus)


For positive integers j ≥ k, an L (j, k)-labeling of a digraph D is a function f from V (D) into the set of nonnegative integers such that | f (x) - f (y) | ≥ j if x is adjacent to y in D and | f (x) - f (y) | ≥ k if x is of distance two to y in D. Elements of the image of f are called labels. The L (j, k)-labeling problem is to determine the over(λ, ⇒)j, k-number over(λ, ⇒)j, k (D) of a digraph D, which is the minimum of the maximum label used in an L (j, k)-labeling of D. This paper studies over(λ, ⇒)j, k-numbers of digraphs. In particular, we determine over(λ, ⇒)j, k-numbers of digraphs whose longest dipath is of length at most 2, and over(λ, ⇒)j, k-numbers of ditrees having dipaths of length 4. We also give bounds for over(λ, ⇒)j, k-numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present a linear-time algorithm for determining over(λ, ⇒)j, 1-numbers of ditrees whose longest dipath is of length 3.

頁(從 - 到)1007-1013
期刊Discrete Applied Mathematics
出版狀態已出版 - 15 4月 2007


深入研究「Distance-two labelings of digraphs」主題。共同形成了獨特的指紋。