ON ERDS'S PROBLEM OF BANDWIDTH OF GRAPH ADDING EDGE  

作　　者：王建方 姚兵 郭锡伯 

机构地区：[1]Institute of Applied Mathematics, Academia Sinica, Beijing 100080, PRC [2]Northwest Normal University, Lanzhou 730070, PRC [3]Beijing Information Technology Institute, Beijing 100083, PRC

出　　处：《Chinese Science Bulletin》1990年第17期1492-1493,共2页

摘　　要：G+e denotes the graph obtained from the graph G by adding the edge e, the comple- ment graph of G, B(G) the bandwidth of G. In 1971, Erds asked whether B(G+e)≤B(G)+1 for any graph G and any edge e.In this letter, the problem was completely solved. It is shown by the following three the-

关 键 词：asked LETTER adding BANDWIDTH 酥子 幼少 

分 类 号：N[自然科学总论]