A study on cyclic bandwidth sum

DOI10.1007/s10878-007-9051-yzbMath1133.05086OpenAlexW2080068977MaRDI QIDQ2471051

Ying-Da Chen, Jing-Ho Yan

Publication date: 18 February 2008

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

Full work available at URL: https://doi.org/10.1007/s10878-007-9051-y

zbMATH Keywords

TreeComplete bipartite graphBalanced 2-colorCyclic bandwidth sumCyclic displacementExtended labelingProper labelingZero cycle

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Alternative evaluation functions for the cyclic bandwidth sum problem

Cites Work

• On optimal linear arrangements of trees
• The bandwidth sum of join and composition of graphs
• Complexity Results for Bandwidth Minimization
• Optimal Assignments of Numbers to Vertices
• Characterization of graphs with equal bandwidth and cyclic bandwidth
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A study on cyclic bandwidth sum