Clique polynomials and independent set polynomials of graphs

@article{Hoede1994CliquePA,
  title={Clique polynomials and independent set polynomials of graphs},
  author={Cornelis Hoede and Xueliang Li},
  journal={Discrete Mathematics},
  year={1994},
  volume={125},
  pages={219-228}
}
This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

The number of words of length n in a free “semi abelian

D. C. Fisher
monoid, Amer. Math. Monthly • 1989
View 5 Excerpts
Highly Influenced

Algebraic Graph Theory (Cambridge

N. Biggs
1974
View 3 Excerpts
Highly Influenced

Matchings and walks in graphs ,

A. E. Solow
J . Graph Theory • 1990

The number of words of length n in a free “ semi abelian ” monoid

D. C. Fisher
Amer . Math . Monthly • 1989

On the theory of the matching polynomial

I. Gutman
J . Graph Theory • 1984

An introduction to matching polynomials

E. J. Farrell
J. Combin. Theory Ser. B • 1979

Similar Papers

Loading similar papers…