3 citations · 8 across the 12 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
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…
cs.DM2015
Monotonic Properties of Collections of 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. The graph G is known to be a Konig-Egervary if alpha(G) + mu…