A lower bound for the vertex boundary-width of complete k-ary trees
نویسندگان
چکیده
منابع مشابه
A lower bound for the vertex boundary-width of complete k-ary trees
The vertex boundary-width problem (for short VBWP) is to determine the value of vbw(G)=max1 |V |minS⊆V,|S|= |N(S)| for a given graph G= (V ,E), where N(S)= {v / ∈ S|v is a neighbor of u for some u ∈ S}. In this paper, we give a lower bound for vertex boundary-width of complete k-ary trees. © 2007 Elsevier B.V. All rights reserved.
متن کامل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 ...
متن کاملComplete k-ary trees and Hamming graphs
A Hamming graph H(b, n) of base b and dimension n has vertex set {X = x1x2 . . . xn : xi ∈ {0, 1, . . . , b − 1}, for 1 ≤ i ≤ n} and edge set {(X, Y ) : X and Y differ in exactly one bit position}. In this paper, we are concerned with the following problem: Given positive integers b, k and h, what is the minimum integer m = m(b, k, h) such that the complete k-ary tree, T k h , of height h, is a...
متن کاملThe vulnerability of complete k - ary trees 1
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various graph parameters like toughness, integrity, scattering number, tenacity and rupture degree. The complete k-ary trees are widely used in systems ra...
متن کامل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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.05.014