| 图的循环带宽和 |
| |
| 引用本文： | 郝建修.图的循环带宽和[J].高校应用数学学报(英文版),2001,16(2):115-121. |
| |
| 作者姓名： | 郝建修 |
| |
| 作者单位： | Hao JianxiuDept.ofMath.，ZhengzhouUniv.，Zhengzhou450052，Dept.ofMath.，AnyangTeachersCollege，Anyang45500 |
| |
| 摘 要： | Abstract. Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied.
|
| 关 键 词： | 图论 循环带宽 下界 简单图 组合学 |
| 收稿时间： | 22 May 2000 |
Cyclic bandwidth sum of graphs |
| |
| Hao Jianxiu.Cyclic bandwidth sum of graphs[J].Applied Mathematics A Journal of Chinese Universities,2001,16(2):115-121. |
| |
| Authors: | Hao Jianxiu |
| |
| Institution: | (1) Dept. of Math., Zhengzhou Univ., 450052 Zhengzhou;(2) Dept. of Math., Anyang Teachers College, 455002 Anyang |
| |
| Abstract: | Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied. |
| |
| Keywords: | Graph labeling cyclic bandwidth sum optimal cyclic labeling |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
