Roots of Independence Polynomials of Well Covered Graphs
Authors:
Open Access
- 1 May 2000
- journal article
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 11 (3) , 197-210
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Polynomial invariants of graphs IIGraphs and Combinatorics, 1996
- On the Log Concavity of Reliability and Matroidal SequencesAdvances in Applied Mathematics, 1994
- Clique polynomials and independent set polynomials of graphsDiscrete Mathematics, 1994
- Bounds on the number of complete subgraphsDiscrete Mathematics, 1992
- Dependence polynomialsDiscrete Mathematics, 1990
- Lower bounds on the number of triangles in a graphJournal of Graph Theory, 1989
- Polynomials1989
- On the theory of the matching polynomialJournal of Graph Theory, 1981
- On the Eneström-Kakeya theorem and its sharpnessLinear Algebra and its Applications, 1979
- Advanced Combinatorics1974