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 2022 · math.COShow all

2 papers · 2 filters

math.CO2022

On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs

Vadim E. Levit, Eugen Mandrescu

The independence number $α (G)$ is the cardinality of a maximum independent set, while $μ (G)$ is the size of a maximum matching in $G$ . If $α (G) + μ (G)$ equals the order of $G$ , then…

math.CO2022

A Linear Algorithm for Computing Independence Polynomials of Trees

Ohr Kadrawi, Vadim E. Levit, Ron Yosef +1

An independent set in a graph is a set of pairwise non-adjacent vertices. Let $α (G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$ . Gutman and Harar…