Bandwidth of the product of paths of the same length
Discrete Applied Mathematics(2013)
摘要
In this note we give a numerical expression for the bandwidth bw(Pnd) of the d-product of a path with n edges, Pnd. We prove that this bandwidth is given by the sum of certain multinomial coefficients. We also show that bw(Pnd) is bounded above and below by the largest coefficient in the expansion of (1+x+⋯+xn)k, with k∈{d,d+1}. Moreover, we compare the asymptotic behavior of bw(Pnd) with the bandwidth of the labeling obtained by ordering the vertices of Pnd in lexicographic order.
更多查看译文
关键词
Bandwidth,Product of paths,Hales order
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要