16 citations · 40 across the 13 of their papers we have counts for
7 papers · 2 filters
On Symmetry of Independence Polynomials
Vadim E. Levit, Eugen Mandrescu
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident…
On the Core of a Unicyclic Graph
Vadim E. Levit, Eugen Mandrescu
A set S is independent in a graph G if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets. The independence number alpha(G) is…
On the Structure of the Minimum Critical Independent Set of a Graph
Vadim E. Levit, Eugen Mandrescu
Let G=(V,E). A set S is independent if no two vertices from S are adjacent. The number d(X)= |X|-|N(X)| is the difference of X, and an independent set A is critical if d(A) = max{d…
Critical Sets in Bipartite Graphs
Vadim E. Levit, Eugen Mandrescu
Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent, alpha(G) is the size of a maximum independent set, and core(G) is the intersection of all max…
Vertices Belonging to All Critical Independent Sets of a Graph
Vadim E. Levit, Eugen Mandrescu
Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, and mu(G) i…
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs
Vadim E. Levit, Eugen Mandrescu
A maximum stable set in a graph G is a stable set of maximum cardinality. S is called a local maximum stable set of G if S is a maximum stable set of the subgraph induced by the cl…