16 citations · 19 across the 5 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
math.CO2003
Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
Vadim E. Levit, Eugen Mandrescu
A graph is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any the -th coefficient of a polynomial I(G;…
math.CO2003★ 16 cited
A Family of Well-Covered Graphs with Unimodal Independence Polynomials
Vadim E. Levit, Eugen Mandrescu
If for any the -th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality in graph , then it is called the independence polynomial of…
math.CO2003
On the Roots of Independence Polynomials of Almost All Very Well-Covered Graphs
Vadim E. Levit, Eugen Mandrescu
If for any k the k-th coefficient of a polynomial I(G;x)is equal to the number of stable sets of cardinality k in graph G, then it is called the independence polynomial of G (Gutma…