New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory

This work introduces new bounds on the clique number of graphs derived from a result due to Sos and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of hypergraphs. In particular, we generalize and improve the spectral bounds introduced by Wilf in 1967 and 1986 establishing an interesting link between the clique number and the emerging spectral hypergraph theory field. In order to compute the bounds we face the problem of extracting the leading H-eigenpair of supersymmetric tensors, which is still uncovered in the literature. To this end, we provide two approaches to serve the purpose. Finally, we present some preliminary experimental results.

[1]  Samuel,et al.  A Game-Theoretic Framework for Similarity-Based Data Clustering , 2009 .

[2]  L. Pottier,et al.  Optimization of positive generalized polynomials under constraints. , 1998 .

[3]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[4]  H. Wilf.  The Eigenvalues of a Graph and Its Chromatic Number , 1967 .

[5]  L. Baum,et al.  An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology , 1967 .

[6]  S. L. Hakimi,et al.  Upper Bounds on the Order of a Clique of a Graph , 1972 .

[7]  Lek-Heng Lim,et al.  Singular values and eigenvalues of tensors: a variational approach , 2005, 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005..

[8]  Alexander Schrijver,et al.  A comparison of the Delsarte and Lovász bounds , 1979, IEEE Trans. Inf. Theory.

[9]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[10]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[11]  Liqun Qi,et al.  Eigenvalues of a real supersymmetric tensor , 2005, J. Symb. Comput..

[12]  Huiqing Liu,et al.  Laplacian spectral bounds for clique and independence numbers of graphs , 2007, J. Comb. Theory, Ser. B.

[13]  Herbert S. Wilf,et al.  Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.

[14]  Vera T. Sós,et al.  Extremals of functions on graphs with applications to graphs and hypergraphs , 1982, J. Comb. Theory, Ser. B.

[15]  Marco Budinich.  Exact Bounds on the Order of the Maximum Clique of a Graph , 2003, Discret. Appl. Math..