On bandwidth sums of graphs

DOI10.1007/BF02012624zbMath0833.05068MaRDI QIDQ1898897

Bing Yao, Jian-fang Wang

Publication date: 11 March 1996

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

bandwidthboundsdiametersizeordermaximum degreeindependent numberbandwidth sum

Mathematics Subject Classification ID

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

Related Items (1)

Some results on spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• The bandwidth problem for graphs and matrices—a survey
• Optimal Assignments of Numbers to Vertices

This page was built for publication: On bandwidth sums of graphs