| The L（3,2, 1）-labeling on Bipartite Graphs |
| |
| 引用本文： | YUAN WAN-LIAN ZHAI MING-QING Lǔ CHANG-HONG.The L（3,2, 1）-labeling on Bipartite Graphs[J].东北数学,2009,25(1):79-87. |
| |
| 作者姓名： | YUAN WAN-LIAN ZHAI MING-QING Lǔ CHANG-HONG |
| |
| 作者单位： | YUAN WAN-LIAN(Department of Mathematics, Chuzhou University, Chuzhou, Anhui, 239012);ZHAI MING-QING(Department of Mathematics, Chuzhou University, Chuzhou, Anhui, 239012;Department of Mathematics, East China Normal Univetsity, Shanghai, 200241);LU CHANG-HONG(Department of Mathematics, East China Normal Univetsity, Shanghai, 200241)
|
| |
| 基金项目： | 国家自然科学基金，安徽省自然科学基金 |
| |
| 摘 要： | An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u）-f（v）｜≥1 if dG（u,v） = 3. The L（3, 2,1）-labeling problem is to find the smallest number λ3（G） such that there exists an L（3, 2,1）-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3（T） attains the minimum value.
|
| 关 键 词： | 标记功能 二部图 非负整数 顶点集 危险品 最低值 函数 偶图 |
The L(3,2,1)-labeling on Bipartite Graphs |
| |
| Yuan Wan-lian,Zhai Ming-qing, Lu Chang-hong.The L(3,2,1)-labeling on Bipartite Graphs[J].Northeastern Mathematical Journal,2009,25(1):79-87. |
| |
| Authors: | Yuan Wan-lian Zhai Ming-qing Lu Chang-hong |
| |
| Institution: | 1. Department of Mathematics;Chuzhou University;Chuzhou;Anhui;239012;2. Department of Mathematics;East China Normal University;Shanghai;200241 |
| |
| Abstract: | channel assignment problems, L（2,1）-labeling, L（3, 2,1）-labeling, bi-partite graph, tree |
| |
| Keywords: | channel assignment problems L(2 1)-labeling L(3 2 1)-labeling bi-partite graph tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
