Bandwidth of the composition of two graphs. (Q1406563)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bandwidth of the composition of two graphs. |
scientific article |
Statements
Bandwidth of the composition of two graphs. (English)
0 references
4 September 2003
0 references
Bounds on the bandwidth of the composition of two graphs are established based on conditions on the order of one of the graphs. In case when equality holds in the condition on the order of the graph the bandwidth of the composition graph is found regardless of the structure of the other graph. Some applications of this result are also presented.
0 references
Bandwidth
0 references
Composition
0 references
Diameter
0 references
Density
0 references
0 references
