首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ON BANDWIDTH SUMS OF GRAPHS
作者姓名:姚兵  王建方
作者单位:YAO BING; WANG JIANFANG (Department of Mathematics,Norihwestetern Normal University,Lanzhou 730070,China)(Institute of Applied Mathematics,the Chznese Acadetny of Sciences,Beijing 100080,China)
摘    要:ONBANDWIDTHSUMSOFGRAPHSYAOBING(姚兵);WANGJIANFANG(王建方)(DepartmentofMathematics,NorihwesteternNormalUniversity,Lanzhou730070,Chi...

收稿时间:21 September 1991

On bandwidth sums of graphs
Bing Yao,Jianfang Wang.ON BANDWIDTH SUMS OF GRAPHS[J].Acta Mathematicae Applicatae Sinica,1995,11(1):69-78.
Authors:Bing Yao  Jianfang Wang
Institution:(1) Department of Mathematics, Northwestern Normal University, 730070 Lanzhou, China;(2) Institute of Applied Mathematics, the Chinese Academy of Sciences, 100080 Beijing, China
Abstract:For a graphG=(V,E) of orderp, a 1–1 mappingf:Vrarr{1,2,...,p} is called a labelling ofG. B sum(G)=min f {Sgr(u,v)notinE |f(u)–f(v)|:f is a labelling ofG} is called the bandwidth sum ofG.In this paper, some lower bounds and upper bounds of bandwidth sums of graphs are given.This research is supported by the National Natural Science Foundation of China.
Keywords:Bandwidth sum of a graph
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号