Bounding the roots of independence polynomials

Ars Combinatoria

Volumn 58, Issue , 2001, Pages 113-120

  Brown, J I ^a   Nowakowski, R J ^a  

^a NONE

Author keywords

Independence polynomial; Line graph; Modulus; Root

Indexed keywords

EID: 0039190151     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. N. Anderson, E.B. Saff and R.S. Varga, On the Eneström-Kakeya theorem and its sharpness, Lin. Alg. Appl. 28 (1979), pp. 5-16.
2. J.I. Brown, K. Dilcher and R.J. Nowakowski, Roots of independence polynomials of well covered graphs, J. Alg. Combin., accepted for publication.
3. L. Comtet, Advanced Combinatorics, Reidel Pub. Co., Boston, 1974.
4. D.C. Fisher and A.E. Solow. Dependence polynomials, Disc. Math. 82 (1990), pp. 251-258.
5. D.C. Fisher and J. Ryan, Bounds on the number of complete subgraphs, Disc. Math. 103 (1992), pp. 313-320.
6. C.D. Godsil and I. Gutman, On the theory of matching polynomials J. Graph Theory 5 (1981), pp. 137-144.
7. C. Godsil, Real graph polynomials, in: Progress in Graph Theory, Academic Press, Toronto, 1984, pp. 281-293.
8. I. Gutman, Some analytic properties of the independence and matching polynomials, Match 28 (1992), pp. 139-150.
9. O.J. Heilmann and E.H. Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), pp. 190-232.
10. R.C. Read and W.T. Tutte, Chromatic polynomials, in: Selected Topics in Graph Theory 3 (L.W. Beineke and R.J. Wilson, ed.), Academic Press, New York, 1988, pp. 15-42.