作者: Louis J. Billera , Saúl A. Blanco
DOI: 10.1016/J.DAM.2013.05.038
关键词:
摘要: In this note we give a numerical expression for the bandwidth bw(P"n^d) of d-product path with n edges, P"n^d. We prove that is given by sum certain multinomial coefficients. also show bounded above and below largest coefficient in expansion (1+x+...+x^n)^k, k@?{d,d+1}. Moreover, compare asymptotic behavior labeling obtained ordering vertices P"n^d lexicographic order.