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 2024Show all

5 papers · 1 filter

math.CO2024

On corona of Konig-Egervary graphs

Vadim E. Levit, Eugen Mandrescu

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

math.CO2024

Log-concavity of the independence polynomials of $W_{p}$ graphs

Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu +1

Let $G$ be a graph of order $n$ . For a positive integer $p$ , $G$ is said to be a $W_{p}$ graph if $n \geq p$ and every $p$ pairwise disjoint independent sets of $G$ are con…

math.CO2024

Almost Bipartite non-König-Egerváry Graphs Revisited

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 $G = (V, E)$ . It is known that if $α(G)+μ(G)=\left\vert…

math.CO2024

Recognizing Relating Edges in Graphs without Cycles of Length 6

Vadim E. Levit, David Tankus

A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w : V (G) ⟶ R$ be a weight function. Then $G$ is $w$ -well-covered i…

math.CO2024★ 1 cited

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property

Vadim E. Levit, Eugen Mandrescu

The graph G=(V,E) is called Konig-Egervary if the sum of its independence number and its matching number equals its order. Let RV(G) denote the number of vertices v such that G-v i…

On corona of Konig-Egervary graphs

Log-concavity of the independence polynomials of Wp​ graphs

Almost Bipartite non-König-Egerváry Graphs Revisited

Recognizing Relating Edges in Graphs without Cycles of Length 6

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property

Log-concavity of the independence polynomials of $W_{p}$ graphs