Cyclic bandwidth sum of graphs

DOI10.1007/S11766-001-0016-0zbMath0985.05045OpenAlexW61221464MaRDI QIDQ5943374

Jianxiu Hao

Publication date: 20 May 2002

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-001-0016-0

zbMATH Keywords

labelingboundscycle bandwidth sum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Alternative evaluation functions for the cyclic bandwidth sum problem

Cites Work

• A framework for solving VLSI graph layout problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic bandwidth sum of graphs