On bandwidth and edgesum for the composition of two graphs
From MaRDI portal
Publication:1897434
DOI10.1016/0012-365X(94)00013-9zbMath0832.05092WikidataQ127704201 ScholiaQ127704201MaRDI QIDQ1897434
Jiuqiang Liu, Kenneth L. Williams
Publication date: 20 February 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (3)
Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ Bandwidth of the composition of two graphs. ⋮ The bandwidth sum of join and composition of graphs
Cites Work
- On optimal linear arrangements of trees
- The bandwidth problem and operations on graphs
- Optimal labelling of a product of two paths
- The NP-completeness of the bandwidth minimization problem
- Some simplified NP-complete graph problems
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Assignment of Numbers to Vertices
- Optimal Numberings of an $N \times N$ Array
- Optimal numberings and isoperimetric problems on graphs
- Optimal Assignments of Numbers to Vertices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On bandwidth and edgesum for the composition of two graphs
