Paper Info
Title
Bandwidth of the product of paths of the same length
Abstract
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.
Year
DOI
Venue
2013
10.1016/j.dam.2013.05.038
Discrete Applied Mathematics
Keywords
DocType
Volume
Bandwidth,Product of paths,Hales order
Journal
161
Issue
ISSN
Citations 
18
0166-218X
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Louis J. Billera127957.41
Saúl A. Blanco273.26