A Note on Independent Sets in Trees
نویسنده
چکیده
We give a simple graph-theoretical proofthat the largest number ofmaximal independent vertex sets in a tree with n vertices is given by 2k+ if n 2k, m(T) 2 if n 2k + 1, a result first proved by Wilf [SIAM J. Algebraic Discrete Methods, 7 (I 986), pp. 125-130]. We also characterize those trees achieving this maximum value. Finally we investigate some related problems. Key words, independent vertices, trees, extremal graphs AMS(MOS) subject classifications. 05C35, 05C30, 05C70
منابع مشابه
A note on the number of matchings and independent sets in trees
We prove best-possible upper and lower bounds on the number of matchings in a tree in terms of the number of independent sets and the number of 2-independent sets. © 2004 Elsevier B.V. All rights reserved.
متن کاملA note on r-equitable k-colorings of trees
A graph G = (V,E) is r-equitably k-colorable if there exists a partition of V into k independent sets V1, V2, · · · , Vk such that | |Vi| − |Vj | | ≤ r for all i, j ∈ {1, 2, · · · , k}. In this note, we show that if two trees T1 and T2 of order at least two are r-equitably k-colorable for r ≥ 1 and k ≥ 3, then all trees obtained by adding an arbitrary edge between T1 and T2 are also r-equitably...
متن کامل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...
متن کاملA note on decision making in medical investigations using new divergence measures for intuitionistic fuzzy sets
Srivastava and Maheshwari (Iranian Journal of Fuzzy Systems 13(1)(2016) 25-44) introduced a new divergence measure for intuitionisticfuzzy sets (IFSs). The properties of the proposed divergence measurewere studied and the efficiency of the proposed divergence measurein the context of medical diagnosis was also demonstrated. In thisnote, we point out some errors in ...
متن کامل?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 1 شماره
صفحات -
تاریخ انتشار 1988