The bandwidth sum of join and composition of graphs
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 434867 (Why is no real title available?)
- scientific article; zbMATH DE number 1156610 (Why is no real title available?)
- scientific article; zbMATH DE number 840700 (Why is no real title available?)
- On bandwidth and edgesum for the composition of two graphs
- On optimal linear arrangements of trees
- Optimal Assignments of Numbers to Vertices
- Some simplified NP-complete graph problems
Cited in
(11)- Bandwidth of the composition of two graphs.
- On bandwidth and edgesum for the composition of two graphs
- On bandwidth sums of graphs
- A study on cyclic bandwidth sum
- scientific article; zbMATH DE number 3732090 (Why is no real title available?)
- scientific article; zbMATH DE number 140091 (Why is no real title available?)
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- scientific article; zbMATH DE number 638678 (Why is no real title available?)
- scientific article; zbMATH DE number 1109395 (Why is no real title available?)
- scientific article; zbMATH DE number 1868528 (Why is no real title available?)
- Multilevel Bandwidth and Radio Labelings of Graphs
This page was built for publication: The bandwidth sum of join and composition of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772413)