Bandwidth sums of block graphs and cacti

DOI10.1007/S10878-012-9548-XMaRDI QIDQ2015805zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 June 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9548-x

zbMATH Keywords

bandwidth sumblock graphblock-cut-vertex graphcactuslabeling

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1382303
• On bandwidth sums of graphs
• A study on cyclic bandwidth sum
• Cyclic bandwidth sum of graphs
• Bandwidth and density for block graphs

Cites work

• scientific article; zbMATH DE number 434867 (Why is no real title available?)
• scientific article; zbMATH DE number 840700 (Why is no real title available?)
• On optimal linear arrangements of trees
• Optimal Assignments of Numbers to Vertices

Cited in

(7)

• Bandwidth and density for block graphs
• On bandwidth sums of graphs
• A study on cyclic bandwidth sum
• scientific article; zbMATH DE number 1382303 (Why is no real title available?)
• scientific article; zbMATH DE number 2165839 (Why is no real title available?)
• Cyclic bandwidth sum of graphs
• The relationship between BS(H) and BS(G)

This page was built for publication: Bandwidth sums of block graphs and cacti

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015805)