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