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.10731040);the Shanghai Leading Academic Discipline Project (No.S30104)
The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G-U,which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edge...
the National Natural Science Foundation of China (Grant No.10731040)
This paper is contributed to the combinatorial properties of the MSS sequences, which are the periodic kneading words of quadratic maps defined on a interval. An explicit expression of adjacency relations on MSS seque...
the National Natural Science Foundation of China (Grant No.10731040)
This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of giv...