supported by National Natural Foundation of China(Grant No.10731040);supported by National Natural Foundation of China(Grant No.11001249);Ph.D.Programs Foundation of Ministry of Education of China (Grant No.20093127110001);Zhejiang Innovation Project(Grant No.T200905)
Let Circ(r, n) be a circular graph. It is well known that its independence number α(Circ(r, n)) = r. In this paper we prove that for every vertex transitive graph H, and describe the structure of maximum indepe...
Supported by the National Natural Science Foundation of China (No. 11001249);the Mathematical Tianyuan Foundation of China (No. 11026180)
For k = (k1,...,kn) E Nn, 1 ≤ k1 ≤ ... ≤ kn, let Lkr be the family of labeled r-sets on k given by Lkr:= {{(a1,la1),...,(ar,lar)} : {a1,...,ar} [n],lai ∈ [kai],i = 1,...,r}. A family A of labeled r-sets i...