| 弦图的L(3,2,1)}-标号 |
| |
| 引用本文： | 袁万莲,翟明清. 弦图的L(3,2,1)}-标号[J]. 运筹学学报, 2010, 14(3): 48-54 |
| |
| 作者姓名： | 袁万莲 翟明清 |
| |
| 作者单位： | 滁州学院数学系,滁州,239012 |
| |
| 基金项目： | the Natural Science Foundation of Education Ministry of Anhui Province，the Foundation for the Excellent Young Talents of Anhui Province，the Natural Science Foundation of Chuzhou University |
| |
| 摘 要： | 图 G 的一个 L(3,2,1)- 标号是指从 V(G) 到非负整数集的一个映射 f, 满足: 当 d_G(u,v)=1 时, |f(u)-f(v)|geq 3; 当 d_G(u,v)=2 时, |f(u)-f(v)|geq 2; 当 d_G(u,v)=1 时, |f(u)-f(v)|geq 1. L(3,2,1)-标号问题就是确定出最小的整数 lambda_3(G) 使得 G存在最大标号不超过该数的 L(3,2,1)- 标号. 本文研究了弦图的 L(3,2,1)- 标号问题，获得了弦图及其一些子类, 如扇, r- 路,r- 树等的 lambda_3 数的界.
|
| 关 键 词： | 运筹学 频率分配问题 L(3,2,1)-标号 弦图 r-路 r-树 |
The L(3,2,1)-Labeling on Chordal Graphs |
| |
| Yuan Wanlian,Zhai Mingqing. The L(3,2,1)-Labeling on Chordal Graphs[J]. OR Transactions, 2010, 14(3): 48-54 |
| |
| Authors: | Yuan Wanlian Zhai Mingqing |
| |
| Affiliation: | Yuan Wanlian Zhai Mingqing Department of Mathematics,Chuzhou University,Chuzhou 239012,China |
| |
| Abstract: | 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 d_G(u,v)=1,|f(u)-f(v)|> 2 if d_G(u,v)=2, and |f(u)-f(v)|> 1, if d_G(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. In this paper, we study this problem for chordal graphs. We obtain bounds of lambda_3 number for chordal graphs and its subclasses, such as fan, r-path, r-tree and so on. |
| |
| Keywords: | Operations research channel assignment problems L(3,2,1)-labeling chordal graph r-path r-tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
|
点击此处可从《运筹学学报》下载全文 |
|
