The L(2,1)-labeling problem on graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
316 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
309 | en_US |
dc.citation.volume |
9 | en_US |
dc.citation.woscount |
213 | |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.author |
Kuo, D | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:02:39Z | |
dc.date.available |
2014-12-08T15:02:39Z | |
dc.date.issued |
1996-05-01 | en_US |
dc.description.abstract |
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) greater than or equal to 2 if d(x, y) = 1 and f(x) - f(y) greater than or equal to 1 if d(x, y) = 2. The L(2, 1)-labeling number lambda(G) of G is the smallest number Ic such that G has an L(2, 1)-labeling with max{f(v) : v is an element of V(G)} = k. In this paper, we give exact formulas of lambda(G boolean OR H) and lambda(G + H). We also prove that lambda(G) less than or equal to Delta(2) + Delta for any graph G of maximum degree Delta. For odd-sun-free (OSF)-chordal graphs, the upper bound can be reduced to lambda(G) less than or equal to 2 Delta + 1. For sun-free (SF)-chordal graphs, the upper bound can be reduced to lambda(G) less than or equal to Delta + 2 chi(G) - 2. Finally, we present a polynomial time algorithm to determine lambda(T) for a tree T. | en_US |
dc.identifier.issn |
0895-4801 | en_US |
dc.identifier.journal |
SIAM JOURNAL ON DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/1295 | |
dc.identifier.wosnumber |
WOS:A1996UL33300013 | |
dc.language.iso |
en_US | en_US |
dc.subject |
L(2,1)-labeling | en_US |
dc.subject |
T-coloring | en_US |
dc.subject |
union | en_US |
dc.subject |
join | en_US |
dc.subject |
chordal graph | en_US |
dc.subject |
perfect graph | en_US |
dc.subject |
tree | en_US |
dc.subject |
bipartite matching | en_US |
dc.subject |
algorithm | en_US |
dc.title |
The L(2,1)-labeling problem on graphs | en_US |
dc.type |
Article | en_US |
檔案
- A1996UL33300013.pdf (1.03 MB, Adobe PDF)
所屬典藏: 期刊論文