No label defined (Q4390639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1156610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1156610 |
Statements
10 December 1998
0 references
edgesum
0 references
bandwidth
0 references
profile
0 references
0.8047197461128235
0 references
0.7991739511489868
0 references
0.7958707809448242
0 references
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\).
0 references