摘要
图的圈带宽和问题即为求图G的一个在圈上的标号,并且使得边的总长尽可能地小,用BSc(G)表示.给出了BSc(G)的一个上界并讨论了BSc(G+e)与BSc(G)的关系,其中e E(G).
The cyclic bandwidth sum is to determine length of edges is as small as possible. The cyclic a labelling of graph G in a cycle such that the total bandwidth sum is denoted by BSc （G）. An upper bound of BSc（G） was given, the relationship between BSc（G＋e） and BSc（G） when e is not an edge of G was studied.
出处
《浙江师范大学学报（自然科学版）》
CAS
2005年第3期246-249,共4页
Journal of Zhejiang Normal University:Natural Sciences
基金
浙江省自然科学基金资助项目(M103094Y604167)
关键词
图的标号
图的正常标号
圈带宽和
最优圈标号
graph labelling
proper graph labelling
cyclic bandwidth sum
optimal cyclic labelling
