Bandwidth of the corona of two graphs
From MaRDI portal
Publication:932628
DOI10.1016/j.disc.2007.07.071zbMath1170.05050MaRDI QIDQ932628
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.071
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Cites Work
- The NP-completeness of the bandwidth minimization problem
- Bandwidth of the Cartesian product of two connected graphs
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Unnamed Item
- Unnamed Item