论文信息 - Clique polynomials and independent set polynomials of graphs - 字舞流文

Clique polynomials and independent set polynomials of graphs

This paper introduces two kinds of graph polynomials, clique polynomial andindependent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

Xueliang Li | Cornelis Hoede

[1] Cornelis Hoede. Hard graphs for the maximum clique problem , 1988, Discret. Math..

[2] David C. Fisher. The number of words of length n in a graph monoid , 1989 .

[3] Xueliang Li,et al. Hard graphs for the maximum clique problem II , 1991 .

[4] Ivan Gutman. The Acyclic Polynomial Of A Graph , 1977 .

[5] Yahya Ould Hamidoune. On the numbers of independent k-sets in a claw free graph , 1990, J. Comb. Theory, Ser. B.

[6] E. J. Farrell,et al. An introduction to matching polynomials , 1979, J. Comb. Theory, Ser. B.

[7] Chris D. Godsil. Matchings and walks in graphs , 1981, J. Graph Theory.

[8] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[9] I. Gutman,et al. On the theory of the matching polynomial , 1981, J. Graph Theory.

[10] David C. Fisher,et al. Dependence polynomials , 1990, Discret. Math..