Antibandwidth of complete k-ary trees
نویسندگان
چکیده
The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1, 2, 3, . . . n, so that the minimum difference between labels of adjacent vertices is maximised. The problem is motivated by the obnoxious facility location problem, radiocolouring, work and game scheduling and is dual to the well known bandwidth problem. We prove exact results for the antibandwidth of complete k-ary trees, k even, and estimate the parameter for odd k up to the second order term. This extends previous results for complete binary trees. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Branches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملSeparation numbers of trees
Let G be a graph on n vertices. Given a bijection f : V (G) → {1, 2, . . . , n}, let |f | = min{|f (u) − f (v)| : uv ∈ E(G)}. The separation number s(G) (also known as antibandwidth [T. Calamoneri, A. Massini, L. Török, I. Vrt’o, Antibandwidth of Complete kary trees, Electronic Notes in Discrete Mathematics 24 (2006), 259–266; A. Raspaud, H. Schroder, O. Sykora, L. Török, I. Vrt’o, Antibandwidt...
متن کاملOn Integer Sequences Derived from Balanced k-ary trees
This article investigates numerous integer sequences derived from two special balanced k-ary trees. Main contributions of this article are two fold. The first one is building a taxonomy of various balanced trees. The other pertains to discovering new integer sequences and generalizing existing integer sequences to balanced k-ary trees. The generalized integer sequence formulae for the sum of he...
متن کاملOn Complete and Size Balanced k-ary Tree Integer Sequences
Discovering new integer sequences and generalizing the existing ones are important and of great interest. In this article, various balanced k-ary trees are first studied and their taxonomy is built. In particular, two systematic balanced k-ary trees, whose nth tree is determined by a certain algorithm, are identified, i.e., complete and sizebalanced k-ary trees. The integer sequences from the f...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2006