Vadim E. Levit

most citedVery well-covered graphs and the unimodality conjecture

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2004★ 1 cited

Very well-covered graphs and the unimodality conjecture

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 the graph $G$ , then it is called the independence polynomia…

math.CO2003

Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$ -th coefficient of a polynomial I(G;…