16 citations · 19 across the 5 of their papers we have counts for
7 papers · 1 filter
On -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) equ…
A New Greedoid: The Family of Local Maximum Stable Sets of a Forest
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 if it is a maximum stable set of the subgraph of G spanned by the union of…
Matrices and -Stable Bipartite Graphs
Vadim E. Levit, Eugen Mandrescu
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a grap…
Combinatorial Properties of the Family of Maximum Stable Sets of a Graph
Vadim E. Levit, Eugen Mandrescu
The stability number alpha(G) of a graph G is the cardinality of a maximum stable set in G, xi(G) denotes the size of core(G), where core(G) is the intersection of all maximum stab…
On -Stable Koenig-Egervary Graphs
Vadim E. Levit, Eugen Mandrescu
The stability number of a graph G, is the cardinality of a stable set of maximum size in G. If the stability number of G remains the same upon the addition of any edge, then G is c…
The Intersection of All Maximum Stable Sets of a Tree and its Pendant Vertices
Vadim E. Levit, Eugen Mandrescu
One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stabl…