scientific article; zbMATH DE number 434867

MaRDI QIDQ3139716zbMATH OpenFDO

Authors Kenneth L. Williams

Publication date 11 November 1993

zbMATH Keywords

bandwidth sumNP-completepolynomial time numbering algorithmproper numberingsum-deterministic graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 140091
• scientific article; zbMATH DE number 434702
• On bandwidth and edgesum for the composition of two graphs
• scientific article; zbMATH DE number 1382303
• On bandwidth sums of graphs

Cited in

(13)

• The bandwidth sum of join and composition of graphs
• On bandwidth and edgesum for the composition of two graphs
• On bandwidth sums of graphs
• Bandwidth sums of block graphs and cacti
• A study on cyclic bandwidth sum
• scientific article; zbMATH DE number 434702 (Why is no real title available?)
• scientific article; zbMATH DE number 1382303 (Why is no real title available?)
• scientific article; zbMATH DE number 140091 (Why is no real title available?)
• scientific article; zbMATH DE number 617555 (Why is no real title available?)
• scientific article; zbMATH DE number 638678 (Why is no real title available?)
• scientific article; zbMATH DE number 840700 (Why is no real title available?)
• scientific article; zbMATH DE number 6453685 (Why is no real title available?)
• Cyclic bandwidth sum of graphs

This page was built for publication:

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