Vadim E. Levit

activity

19992026

most citedVery well-covered graphs with log-concave independence polynomials

20 citations · 106 across the 85 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

On an Annihilation Number Conjecture

Vadim E. Levit, Eugen Mandrescu

Let $α (G)$ denote the cardinality of a maximum independent set, while $μ (G)$ be the size of a maximum matching in the graph $G = (V, E)$ . If $α(G)+μ(G)=\left\vert V\right\…

math.CO2018

On graphs admitting two disjoint maximum independent sets

Zakir Deniz, Vadim E. Levit, Eugen Mandrescu

An independent set A is maximal if it is not a proper subset of an independent set, while A is maximum if it has a maximum size. The problem of whether a graph has a pair of disjoi…