68 citations
- Bar-Ilan UniversityIL1 paper
- Brunel University of LondonGB1 paper
- B. Verkin Institute for Low Temperature Physics and Engineering of the National Academy of Sciences of UkraineUA1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Clarkson UniversityUS1 paper
- Laboratoire National des Champs Magnétiques IntensesFR1 paper
- Tel Aviv UniversityIL1 paper
- University of CyprusCY1 paper
- University of Duisburg-EssenDE1 paper
- University of FreiburgDE1 paper
- University of West LondonGB1 paper
5 papers · 1 filter
Very well-covered graphs and the unimodality conjecture
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 the graph , then it is called the independence polynomia…
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;…
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…
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…
On Unimodality of Independence Polynomials of some Well-Covered Trees
Vadim E. Levit, Eugen Mandrescu
The number of stable sets of cardinality in graph is the -th coefficient of the independence polynomial of (I. Gutman and F. Harary, 1983). In 1990, Y. O. Hamidoune…