1.2k citations
- Bar-Ilan UniversityIL101 papers
- Tel Aviv UniversityIL68 papers
- Universität HamburgDE44 papers
- Institut d'Estudis Espacials de CatalunyaES39 papers
- Heidelberg UniversityDE34 papers
- Institute of Space SciencesES31 papers
- University College LondonGB29 papers
- Holon Institute of TechnologyIL27 papers
- Max Planck Institute for AstronomyDE27 papers
- Technion – Israel Institute of TechnologyIL26 papers
- National Yang Ming Chiao Tung UniversityTW25 papers
- Universidad Complutense de MadridES25 papers
Showing 2009 · math.COShow all
3 papers · 2 filters
math.CO2009★ 2 cited
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…
math.CO2009
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}…
math.CO2009★ 6 cited
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…