图的强乘积的带宽

The Bandwidth of the Union of Two Graphs

本文讨论了由两个图的强乘积所导出的一些特殊图的带宽.

In this paper,we discuss the bandwidth of the union of two graphs. Our main result is that:For any two graphs G and H with |V(G)|=m and V(H)|=n,B(G(?)H)≤min{Bm (H)+B(G),nB(G)+B(H)}. This upper bound is attaired by P_m^r(?)P_n^t,P_m^r(?)C_n^t and C_m^r(?)C_n^t.