In 1941, Turán proved the famous Turán theorem, i.e., if G is a graph which does not contain K_r ₊₁ as its subgraph, then the edge number of G is no more than the Turan graph T_n,r which started the extremal theory of graphs. In this talk, we will introduce the spectral Turán-Type results which are associated with the adjacency matrix and signless Laplacian matrix. Moreover, some open problems in this field are proposed.

Add:Building 58, The School of Mathematics, Tianjin University Beiyangyuan Campus,

No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC

Tel:022-60787827 Mail:math@tju.edu.cn