DC Field | Value | Language |
dc.contributor | 國立臺灣大學數學系 | zh_TW |
dc.contributor.author | Chang, Gerard-J | en |
dc.contributor.author | Chen, Jer-Jeong | en |
dc.contributor.author | Kuo, David | en |
dc.contributor.author | Liaw, Sheng-Chyang | en |
dc.creator | Chang, Gerard-J; Chen, Jer-Jeong; Kuo, David; Liaw, Sheng-Chyang | en |
dc.date | 2004-07-08 | zh_TW |
dc.date.accessioned | 2006-09-27T09:02:20Z | - |
dc.date.accessioned | 2018-06-28T09:11:31Z | - |
dc.date.available | 2006-09-27T09:02:20Z | - |
dc.date.available | 2018-06-28T09:11:31Z | - |
dc.date.issued | 2004-07-08 | - |
dc.identifier | 20060927121137195236 | zh_TW |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/20060927121137195236 | - |
dc.description.abstract | 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 & |f(x) − f(y)| ≥ k if x is of distant two to y in D. Elements of the
image of f are called labels. The L(j, k)-labeling problem is to determine the ~λj,k-
number ~λ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 ~λj,k-numbers of digraphs. In particular,
we determine ~λj,k-numbers of digraphs whose longest dipath is of length at most 2,
and ~λj,k-numbers of ditrees having dipaths of length 4. We also give bounds for ~λj,k-
numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present
a linear-time algorithm for determining ~λj,1-numbers of ditrees whose longest dipath
is of length 3. | en |
dc.format | application/pdf | en |
dc.format.extent | 142129 bytes | en |
dc.format.mimetype | application/pdf | en |
dc.language | zh-TW | zh_TW |
dc.language.iso | zh_TW | zh_TW |
dc.relation | math.CO/0407167 v1 | en |
dc.relation.ispartof | math.CO/0407167 | - |
dc.source | http://www.math.ntu.edu.tw/~gjchang/courses/2005-02-graph-algorithm/arxiv-math-co-0407167.pdf | en |
dc.subject | L(j,k)-labeling | en |
dc.subject | digraph | en |
dc.subject | ditree | en |
dc.subject | homomorphism | en |
dc.subject | algorithm | en |
dc.title | Distance-two labelings of digraphs | en |
dc.type | journal article | en |
dc.relation.pages | - | - |
dc.relation.journalvolume | v1 | - |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/20060927121137195236/1/arxiv-math-co-0407167.pdf | - |
item.languageiso639-1 | zh_TW | - |
item.cerifentitytype | Publications | - |
item.fulltext | with fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | journal article | - |
item.grantfulltext | open | - |
Appears in Collections: | 數學系
|