Abstract
In this note we give a numerical expression for the bandwidth of the -product of a path with edges, . We prove that this bandwidth is given by the sum of certain multinomial coefficients. We also show that is bounded above and below by the largest coefficient in the expansion of , with . Moreover, we compare the asymptotic behavior of with the bandwidth of the labeling obtained by ordering the vertices of in lexicographic order.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.