scientific article; zbMATH DE number 1156603

MaRDI QIDQ4390632zbMATH OpenFDO

Authors Robert Brigham, Julie R. Carrington, Richard P. Vitray, Douglas G. Rogers

Publication date 1 November 1998

zbMATH Keywords

complete \(k\)-ary treeadditive bandwidth

Mathematics Subject Classification ID

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

Recommendations

• Bandwidth of the complete \(k\)-ary tree
• Publication:4863471
• scientific article; zbMATH DE number 798647

Cited in

(8)

• scientific article; zbMATH DE number 841625 (Why is no real title available?)
• Some results on the antibandwidth of \(k\)-ary complete trees of height 3 for odd \(k\)
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees
• Antibandwidth of complete \(k\)-ary trees
• On the problem of bandsize
• The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)
• scientific article; zbMATH DE number 434702 (Why is no real title available?)
• Bandwidth of the complete \(k\)-ary tree

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 Q4390632)