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 cs.DMShow all

31 papers · 1 filter

cs.DM2020

Critical sets, crowns, and local maximum independent sets

Vadim E. Levit, Eugen Mandrescu

A set $S \subseteq V (G)$ is independent (or stable) if no two vertices from $S$ are adjacent, and by $Ind (G)$ we mean the set of all independent sets of $G$ . A set $A\in\ma…

cs.DM2019

On the Critical Difference of Almost Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu

A set $S \subseteq V$ is \textit{independent} in a graph $G = (V, E)$ if no two vertices from $S$ are adjacent. The \textit{independence number} $α (G)$ is the cardinality…

cs.DM2018

Recognizing generating subgraphs revisited

Vadim E. Levit, David Tankus

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$ -well-cove…

cs.DM2018

Generating subgraphs in chordal graphs

Vadim E. Levit, David Tankus

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$ -well-cove…

cs.DM2015

On Konig-Egervary Collections of Maximum Critical Independent Sets

Vadim E. Levit, Eugen Mandrescu

Let G be a simple graph with vertex set V(G). A set S is independent if no two vertices from S are adjacent. The graph G is known to be a Konig-Egervary if alpha(G)+mu(G)= |V(G)|,…

cs.DM2015

Critical and Maximum Independent Sets of a Graph

Adi Jarden, Vadim E. Levit, Eugen Mandrescu

Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. By Ind(G) we mean the family of all independent sets of G wh…