The relationship between \(BS(H)\) and \(BS(G)\) (Q874782)

An \(n\)-labeling \(f\) of a hypergraph \(H\) with \(n\) vertices and \(m\) edges \(E=\{E_1,\dots,E_m\}\) is an assigment of distinct integers between \(1\) and \(n\) to the vertices of \(H\). The bandwidth sum of \(H\) and the \(n\)-labeling \(f\) is defined as \(BS(H,f)=\sum_{E_i\in E}\max\{f(u)-f(v)\); \(u,v\in E_i\}\) and the bandwidth sum \(BS(H)\) of \(H\) is the minimum bandwidth sum \(BS(H,f)\) of \(H\) and \(f\) over all \(n\)-labelings \(f\) of \(H\). The paper describes a class \(\widehat{G}\) of multigraphs derived from \(H\) and proves that \(BS(H)=\min\{BS(G)\mid G\in \widehat{G}\}\).