Roots of Independence Polynomials of Well Covered Graphs

Journal of Algebraic Combinatorics

Volumn 11, Issue 3, 2000, Pages 197-210

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

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Graph; Independence; Polynomial; Root; Well covered

Indexed keywords

EID: 0013528487     PISSN: 09259899     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008705614290     Document Type: Article

References (32)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, National Bureau of Standards, Washington, D.C., 1964.
2. Y. Alavi, P. Malde, A.J. Schwenk, and P. Erdös, "The vertex independence sequence of a graph is not constrained," Congr. Numer. 58 (1987), 15-23.
3. N. Anderson, E.B. Saff, and R.S. Varga, "On the Eneström-Kakeya theorem and its sharpness," Lin. Alg. Appl. 28 (1979), 5-16.
4. E.J. Barbeau, Polynomials, Springer-Verlag, New York, 1989.
5. J.I. Brown and C.J. Colbourn, "Roots of the reliability polynomial," SIAM J. Disc. Math. 5 (1992), 571-585.
6. J.I. Brown and C.J. Colbourn, "On the log concavity of reliability and matroidal sequences," Adv. Appl. Math. 15 (1994), 114-127.
7. G. Chartrand and L. Lesniak, Graphs and Digraphs, Wadsworth and Brooks/Cole, Monterey, 1986.
8. F.R.K. Chung, P.C. Fishburn, and R.L. Graham, "On unimodality for linear extensions of partial orders," SIAM J. Alg. Disc. Meth. 1 (1980), 405-410.
9. L. Comtet, Advanced Combinatorics, Reidel Pub. Co., Boston, 1974.
10. D.C. Fisher, "Lower bounds on the number of triangles in a graph," J. Graph Th. 13 (1989), 505-512.
11. D.C. Fisher and J. Ryan, "Bounds on the number of complete subgraphs," Disc. Math. 103 (1992), 313-320.
12. D.C. Fisher and A.E. Solow, "Dependence Polynomials," Disc. Math. 82 (1990), 251-258.
13. C. Godsil, "Real graph polynomials," Progress in Graph Theory, Academic Press, Toronto, 1984, pp. 281-293.
14. C.D. Godsil and I. Gutman, "On the theory of matching polynomials," J. Graph Theory 5 (1981), 137-144.
15. I. Gutman, "An identity for the independence polynomials of trees," Publ. Inst. Math. (Beograd) (N.S.) 50 (1991), 19-23.
16. I. Gutman, "Independent vertex sets in some compound graphs," Publ. Inst. Math. (Beograd) (N.S.) 66 (1992), 5-9.
17. I. Gutman, "Some analytic properties of the independence and matching polynomials," Match 28 (1992), 139-150.
18. I. Gutman and F. Harary, "Generalizations of the matching polynomial," Utilitas Math. 24 (1983), 97-106.
19. Y.O. Hamidoune, "On the number of independent k-sets in a claw free graph," J. Combin. Theory B 50 (1990), 241-244.
20. E.R. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, N.J., 1975.
21. C. Hoede and X. Li, "Clique polynomials and independent set polynomials of graphs," Discrete Math. 125 (1994), 219-228.
22. A. Hurwitz, "Über die Wurzeln einiger transcendenter Gleichungen," Mitteilungen Math. Ges. Hamburg 2 (1890), 25-31. Also in Mathematische Werke, Band 1, Birkäuser Verlag, Basel, 1962, pp. 299-305.
23. A. Hurwitz, "Über die Wurzeln einiger transcendenter Gleichungen," Mitteilungen Math. Ges. Hamburg 2 (1890), 25-31. Also in Mathematische Werke, Band 1, Birkäuser Verlag, Basel, 1962, pp. 299-305.
24. C. Mahoney, "On the unimodality of the independent set numbers of a class of matroids," J. Combin. Theory Ser. B 39 (1985), 77-85.
25. M. Marden, Geometry of Polynomials, 2nd edition, American Mathematical Society, Providence, 1966.
26. J.H. Mason, "Matroids: unimodal conjectures and Motzkin's theorem," in Combinatorics, D.J.A. Welsh and D.R. Woodall (Eds.), London Math Soc., London, 1972, pp. 207-221.
27. S. Negami and K. Ota, "Polynomial invariants of graphs II," Graphs and Combin. 12 (1996), 189-198.
28. M.D. Plummer, "Some covering concepts in graphs," J. Combin. Theory 8 (1970), 91-98.
29. M.D. Plummer, "Well-covered graphs: a survey," Quaestiones Math. 8 (1993), 91-98.
30. R.C. Read and W.T. Tutte, "Chromatic polynomials," in Selected Topics in Graph Theory 3, L.W Beineke and R.J. Wilson (Eds.), Academic Press, New York, 1988, pp. 15-42.
31. R.P. Stanley, "Two combinatorial applications of the Aleksandrov-Fenchel inequalities," J. Combin. Theory Ser. A 31 (1981), 56-65.
32. D.J.A. Welsh, "Combinatorial problems in matroid theory," Combinatorial Mathematics and its Applications, Academic Press, New York, 1971, pp. 291-307.