CYCLIC BANDWIDTH SUM OF GRAPHS 被引量：2

CYCLIC BANDWIDTH SUM OF GRAPHS

下载PDF

导出

摘要 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. 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.

作者 Hao JianxiuDept.ofMath.,ZhengzhouUniv.,Zhengzhou450052,Dept.ofMath.,AnyangTeachersCollege,Anyang45500

出处《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2001年第2期115-121,共7页 高校应用数学学报（英文版）（B辑）

关键词 Graph labeling cyclic bandwidth sum optimal cyclic labeling. Graph labeling, cyclic bandwidth sum, optimal cyclic labeling.

分类号 O157.5 [理学—基础数学]

引文网络
相关文献

参考文献5

1Chung, F.R.K., Labelings of graphs, In: Beineke, L.W. andWilson, R.J.,eds., Selected Topics in Graph Theory, 1988,3:151-168.
2Bhatt,S.N. and Leighton, F.T., A framework for solving VLSI graph layout problems,J.Computer and System Sciences, 1984,28:300-343.
3Yuan Jinjiang, Cyclic arrangement of graphs, Graph Theory Notes of New York,NewYork Academy of Sciences,1995,6-10.
4Lin Yixun, Minimum bandwidth problem for embedding graphs in cycles, Networks,1997,29:135-140.
5Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, Macmillan Press Ltd.,London, 1976.

同被引文献3

1黄丹君,卜月华.图的圈带宽和[J].浙江师范大学学报（自然科学版）,2005,28(3):246-249. 被引量：1
2Wang J F,West D B,Yao B.Maximum bandwidth under edge addition[J].Graph Theory,1995,1:87-90.
3Chan W H,Peter Lam C B,Shiu W C.Cyclic bandwidth with an edge added[J].Discrete Applied Mathematics,2008,156:131-137.

引证文献2

1黄丹君,卜月华.图的圈带宽和[J].浙江师范大学学报（自然科学版）,2005,28(3):246-249. 被引量：1
2林艺舒,刘岩.图加一条边后的带宽和[J].运筹学学报,2014,18(4):105-110.

二级引证文献1

1林艺舒,刘岩.图加一条边后的带宽和[J].运筹学学报,2014,18(4):105-110.

1原晋江.关于图的循环带宽的一些结果[J].新疆大学学报（自然科学版）,1994,11(2):16-18.
2李文权.联图与补图的循环带宽[J].郑州大学学报（理学版）,1994,31(2):20-25.
3韦娜娜,李愿.Some Properties of D-Concurrence[J].Communications in Theoretical Physics,2012,58(10):483-486. 被引量：1
4周三明.图的循环带宽的Harper型下界[J].华中理工大学学报,1997,25(A01):92-94.
5李怀恩,辛自力.关于循环带宽的Harper方法[J].郑州大学学报（自然科学版）,1994,26(3):21-24.
6MARTIN BACA.LABELINGS OF TWO CLASSES OF PLANE GRAPHS[J].Acta Mathematicae Applicatae Sinica,1993,9(1):82-87.
7MArgIN BAcA IVAN HOLLANDER(Department of Mathematics, Technical University, Kosice, Slovakia).ON(a,b)-CONSECUTIVE PETERSEN GRAPHS[J].Acta Mathematicae Applicatae Sinica,1998,14(3):265-270.
8FAN Jianghua and LI PeixingDepartment of Scientific Computation, Zhongshan University, Guangzhou 510275, China,Department of Mathematics , Guangxi Normal University, Guilin 541004, China.Computation of Leray-Schauder fixed points[J].Chinese Science Bulletin,1999,44(8):685-688.
9刘振宏.A NEW SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIAN[J].Chinese Science Bulletin,1987,32(9):639-640.
10张利民.EVERY 4-REGULAR SIMPLE GRAPH CONTAINS A 3-REGULAR SUBGRAPH[J].Chinese Science Bulletin,1986,31(9).

Applied Mathematics(A Journal of Chinese Universities)

2001年第2期

浏览历史

内容加载中请稍等...

CYCLIC BANDWIDTH SUM OF GRAPHS 被引量：2

参考文献5

同被引文献3

引证文献2

二级引证文献1

相关作者

相关机构

相关主题

浏览历史