20 citations · 94 across the 55 of their papers we have counts for
6 papers · 1 filter
A characterization of Konig-Egervary graphs using a common property of all maximum matchings
Vadim E. Levit, Eugen Mandrescu
The independence number of a graph G, denoted by alpha(G), is the cardinality of an independent set of maximum size in G, while mu(G) is the size of a maximum matching in G, i.e.,…
On Konig-Egervary Square-Stable Graphs
Vadim E. Levit, Eugen Mandrescu
The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equal…
Critical independent sets and Konig--Egervary graphs
Vadim E. Levit, Eugen Mandrescu
Let alpha(G) be the cardinality of a independence set of maximum size in the graph G, while mu(G) is the size of a maximum matching. G is a Konig--Egervary graph if its order equal…
A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number
Vadim E. Levit, Eugen Mandrescu
If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha}…
Greedoids on Vertex Sets of Unicycle Graphs
Vadim E. Levit, Eugen Mandrescu
A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed n…
The independence polynomial of a graph at -1
Vadim E. Levit, Eugen Mandrescu
If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha}…