The bandwidth sum of join and composition of graphs (Q1772413)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bandwidth sum of join and composition of graphs |
scientific article; zbMATH DE number 2157728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bandwidth sum of join and composition of graphs |
scientific article; zbMATH DE number 2157728 |
Statements
The bandwidth sum of join and composition of graphs (English)
0 references
18 April 2005
0 references
First of all the authors shortly describe the history of the bandwidth sum problem. Then they give an exact result for the bandwidth sum problem for the join of \(k\) graphs \(G_1,G_2,\dots, G_k\), where each \(G_i\) is a path, cycle, complete graph or union of isolated vertices. Then they give a similar result for the bandwidth sum of the composition of two graphs and some other results.
0 references
