scientific article; zbMATH DE number 1156610

From MaRDI portal
Publication:4390639





The bandwidth (edgesum) of a numbering from 1 to \(| V|\) of the vertices of a graph \(G= (V,E)\) is the maximum (sum) over all edges \(\{v,w\}\in E\) of \(| f(v)- f(w)|\). The bandwidth (edgesum) of a graph is the minimum bandwidth (edgesum) over all such numberings. The profile of a graph \(G= (V,E)\) is the minimum over all such numberings \(f\) of the sum over all vertices \(v\) of \(\max_{\{v,w\}\in E}(f(v)- f(w))\). It is shown that a connected graph \(G= (V,E)\) has bandwidth at least \(n-r\), where \(r\) is the largest integer with \(r(r- 1)\leq| V|(| V|- 1)- 2| E|\). This bound is tight. A similar type of result (with a more complicated formula) is shown for the edgesum. It is shown that, for all \(n\geq 2\) and \(k\) with \(0\leq k\leq n(n- 1)/2\), there is a graph \(G\) with \(n\) vertices, \(k\) edges, and profile exactly \(k\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390639)