Splitting trees at vertices
نویسنده
چکیده
We present tight bounds on splitting trees into “small” subtrees.
منابع مشابه
Splitting trees
Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The splitting number a(T) of a tree T is the minimum number of successive forest splittings which lead to deletion of all of T’s edges. An O(N) algorithm is proposed to get an upper bound c...
متن کاملThe Effect of Salicylic Acid and Potassium on Some Characteristics Nut and Physiological Parameters of Pistachio Trees Cv. Owhadi
The effect of three salicylic acid (0, 50 and 100 mg l-1) and K2SO4 (0, 0.1 and 0.2 %) levels on some characteristics nut and physiological parameters of pistachio trees cv. ‘Owhadi’ were investigated. Treatments were applied at endospermic growth stage of seed and cotyledons appearance. The results showed that potassium increase yield, splitting percentage; nut fresh mass and kernel dry mass a...
متن کاملA NOTE ON THE EQUISEPARABLE TREES
Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the ver...
متن کاملDynamic trees as search trees via Euler tours, applied to the network simplex algorithm
The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. For many applications of dynamic trees, values must be combined along paths. For other applications, values must be combin...
متن کاملOn the spectra of reduced distance matrix of the generalized Bethe trees
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011