The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs

Turan theorem states that the Turan graph Tn,r is the unique graph which has the maximum edge number among the Kr+1-free graphs of order n. In this paper, we prove that Tn,r,h = Kh¯ ∨ Tn−h,r−1 has ...

[1]  Jürgen Eckhoff,et al.  A new Tura'n-type theorem for cliques in graphs , 2004, Discret. Math..

[2]  Vladimir Nikiforov,et al.  Some Inequalities for the Largest Eigenvalue of a Graph , 2002, Combinatorics, Probability and Computing.

[3]  Norbert Sauer.  A generalization of a theorem of Turán , 1971 .

[4]  Richard A. Brualdi,et al.  Two Extremal Problems in Graph Theory , 1994, Electron. J. Comb..

[5]  Bruce Hedman,et al.  Another extremal problem for Turan graphs , 1987, Discret. Math..

[6]  David R. Wood,et al.  On the Maximum Number of Cliques in a Graph , 2006, Graphs Comb..

[7]  Bruce Hedman.  The maximum number of cliques in dense graphs , 1985, Discret. Math..

[8]  Jennifer Ryan,et al.  Bounds on the number of complete subgraphs , 1992, Discret. Math..

[9]  Pál Erdös.  On the number of complete subgraphs and circuits contained in graphs , 1969 .

[10]  Xiaodong Zhang,et al.  Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number , 2012, 1209.3214.

[11]  Steven Roman.  The maximum number of q-cliques in a graph with no p-clique , 1976, Discret. Math..

[12]  Peter Allen,et al.  A Density Corrádi–Hajnal Theorem , 2011, Canadian Journal of Mathematics.

[13]  J. Moon.  On Independent Complete Subgraphs in a Graph , 1968, Canadian Journal of Mathematics.

[14]  Vladimir Nikiforov,et al.  A Spectral Erdős–Stone–Bollobás Theorem , 2007, Combinatorics, Probability and Computing.

[15]  Béla Bollobás,et al.  Cliques and the spectral radius , 2007, J. Comb. Theory, Ser. B.