| OPTIMAL LABELLING OF UNIT INTERVAL GRAPHS |
| |
| 作者姓名： | YUANJINJIANG ZHOUSANMING |
| |
| 作者单位： | [1]DepartmentofMathematics,ZhengzhouUniversity,Zhengzhou450052 [2]DepartmentofMathematics,HuazhongUniversityofScienceandTechnology,Wuhan430074 |
| |
| 摘 要： | This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement).
|
| 关 键 词： | 最优标号 单位区间图 有限简单图 带宽 |
| 收稿时间： | 28 October 1993 |
Optimal labelling of unit interval graphs |
| |
| YUANJINJIANG ZHOUSANMING.OPTIMAL LABELLING OF UNIT INTERVAL GRAPHS[J].Applied Mathematics A Journal of Chinese Universities,1995,10(3):337-344. |
| |
| Authors: | Yuan Jinjiang Zhou Sanming |
| |
| Institution: | YUAN JINJIANG AND ZHOU SANMING |
| |
| Abstract: | This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement). |
| |
| Keywords: | Graph labelling unit interval graph |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
|
