20 citations · 106 across the 85 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DM2010
Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids
Vadim E. Levit, Eugen Mandrescu
A \textit{maximum stable set} in a graph is a stable set of maximum cardinality. is a \textit{local maximum stable set} of , and we write , if is a maximum…
cs.DM2010★ 2 cited
On the independence polynomial of an antiregular graph
Vadim E. Levit, Eugen Mandrescu
A graph with at most two vertices of the same degree is called antiregular (Merris 2003), maximally nonregular (Zykov 1990) or quasiperfect (Behzad, Chartrand 1967). If s_{k} is th…
cs.DM2010
When G^2 is a Konig-Egervary graph?
Vadim E. Levit, Eugen Mandrescu
The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices, whenever the distance between them in G is at most 2…