On bandwidth sums of graphs
The two authors deal with the bandwidth sum problem of graphs \(G\). After having proved two monotonicity properties of the bandwidth sum \(B_{\text{sum}}(G)\) and computed \(B_{\text{sum}}(G)\) of the star \(G= K_{1, n}\), \(n\geq 2\), Yao and Wang determine lower and upper bounds for \(B_{\text{sum}}(G)\) depending on the order \(p(G)\), size \(q(G)\), diameter \(D(G)\), independent number \(\alpha(G)\), maximum degree \(\Delta(G)\) or bandwidth \(B(G)\) of \(G\).
scientific article; zbMATH DE number 800637
scientific article