The bandwidth sum of join and composition of graphs
First of all the authors shortly describe the history of the bandwidth sum problem. Then they give an exact result for the bandwidth sum problem for the join of \(k\) graphs \(G_1,G_2,\dots, G_k\), where each \(G_i\) is a path, cycle, complete graph or union of isolated vertices. Then they give a similar result for the bandwidth sum of the composition of two graphs and some other results.
scientific article; zbMATH DE number 2157728