Recommendations
Cites work
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 638678 (Why is no real title available?)
- scientific article; zbMATH DE number 786174 (Why is no real title available?)
- scientific article; zbMATH DE number 894712 (Why is no real title available?)
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Bandwidth and density for block graphs
- Bandwidth of the complete \(k\)-ary tree
- Complexity Results for Bandwidth Minimization
- Harper-type lower bounds and the bandwidths of the compositions of graphs
- On bandwidth and edgesum for the composition of two graphs
- Optimal numberings and isoperimetric problems on graphs
- The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- The NP-completeness of the bandwidth minimization problem
- The bandwidth problem for graphs and matrices—a survey
Cited in
(6)- scientific article; zbMATH DE number 436077 (Why is no real title available?)
- The bandwidth sum of join and composition of graphs
- scientific article; zbMATH DE number 3732090 (Why is no real title available?)
- scientific article; zbMATH DE number 434482 (Why is no real title available?)
- scientific article; zbMATH DE number 786174 (Why is no real title available?)
- On bandwidth and edgesum for the composition of two graphs
This page was built for publication: Bandwidth of the composition of two graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406563)
