527 citations
- Tel Aviv UniversityIL10 papers
- Ariel UniversityIL9 papers
- Weizmann Institute of ScienceIL7 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- University of HaifaIL5 papers
- Bar-Ilan UniversityIL4 papers
- Jawaharlal Nehru UniversityIN3 papers
- Jerusalem College of TechnologyIL3 papers
- University College LondonGB3 papers
- University of TorontoCA3 papers
- Broad InstituteUS2 papers
- Centre Inria de SaclayFR2 papers
5 papers · 1 filter
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…
Light-induced current in molecular junctions: Local field and non-Markov effects
Boris D. Fainberg, Maxim Sukharev, Tae-Ho Park +1
We consider a two-level system coupled to contacts as a model for charge pump under external laser pulse. The model represents a charge-transfer molecule in a junction, and is a ge…
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…