期刊文献+

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.
出处 《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.
  • 相关文献

参考文献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

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部