期刊文献+

ON NUMBER OF LEAVES ANDBANDWIDTH OF TREES

ON NUMBER OF LEAVES AND BANDWIDTH OF TREES
全文增补中
导出
摘要 Let B(G) denote the bandwidth of graph G. For any tree T, Ve(T) denote the set of leaves(venices of degree l) of T. Wang and Yao[5] obtained that for any tree T, B(T)≤ 「Ve(T) /2」and the bound is sharp. In this paper, we show that any tree may be imbedded into anothertree with the same number of leaves, and for this latter tree, the bound in the above inequalityis reached. In other words, the bound is reached in almost all trees. We also describe trees Sr,d,where d and r are integers and lIVe (Sr,d ) =(d+ 1) × dr- 1. Moreover, we will show that if d (≤2r)is large, the ratio of the bandwidth to the number of leaves of S..d will be very small. Let B(G) denote the bandwidth of graph G. For any tree T, Ve(T) denote the set of leaves(venices of degree l) of T. Wang and Yao[5] obtained that for any tree T, B(T)≤ 「Ve(T) /2」and the bound is sharp. In this paper, we show that any tree may be imbedded into anothertree with the same number of leaves, and for this latter tree, the bound in the above inequalityis reached. In other words, the bound is reached in almost all trees. We also describe trees Sr,d,where d and r are integers and lIVe (Sr,d ) =(d+ 1) × dr- 1. Moreover, we will show that if d (≤2r)is large, the ratio of the bandwidth to the number of leaves of S..d will be very small.
作者 PETERC.B.LAM
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1998年第2期193-196,共4页 应用数学学报(英文版)
关键词 BANDWIDTH LEAVES TREE Bandwidth, leaves, tree
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部