Vadim E. Levit

1. On the Roots of Independence Polynomials of Almost All Very Well-Covered Graphs
   2003/05/15 by Vadim E. Levit, Eugen Mandrescu, Levit, Vadim E. +2 · 1 citation
   Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO #msc:05C05 #msc:05C69 #msc:05E99
2. Very well-covered graphs with log-concave independence polynomials
   2004/11/10 by Vadim E. Levit, Levit, Vadim E., Eugen Mandrescu +1 · 1 citation
   Computer Science · Mathematics · #05A20 #05E99 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Primary 05C69 #Secondary 11B83 #cs.DM #math.CO #msc:05A20 #msc:05C69 #msc:05E99 #msc:11B83
3. The independence polynomial of a graph at -1
   2009/04/30 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +2 · 2 citations
   Computer Science · Mathematics · #05A20 #05C05 (Secondary) #05C69 (Primary) #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Topological and Geometric Data Analysis #cs.DM #math.CO #msc:05A20 #msc:05C05 #msc:05C69
4. A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number
   2009/05/21 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +2 · 1 citation
   Computer Science · Mathematics · #05A20 (Primary) #05C69 #52B05 #57M15 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #cs.DM #math.CO #msc:05A20 #msc:05C69 #msc:52B05 #msc:57M15
5. On Unimodality of Independence Polynomials of some Well-Covered Trees
   2002/11/03 by Vadim E. Levit, Eugen Mandrescu, Levit, Vadim E. +2 · 1 citation
   Mathematics · #Advanced Combinatorial Mathematics #Commutative Algebra and Its Applications #Graph theory and applications #math.CO #msc:05C05 #msc:05C69
6. 1-well-covered graphs revisited
   2016/10/13 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +1 · 2 citations
   Computer Science · Mathematics · #05C25 (Secondary) #05C69 #05C75 #05C76 (Primary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory #semigroups and automata theory
7. The independence polynomial of trees is not always log-concave starting from order 26
   2023/05/02 by Ohr Kadrawi, Vadim E. Levit, Kadrawi, Ohr +1 · 1 citation
   Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Advanced Combinatorial Mathematics
8. The Roller-Coaster Conjecture Revisited
   2016/12/12 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +1 · 1 citation
   Computer Science · Mathematics · #05C31 #05C69 (Primary) 05C30 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #Graph theory and applications #Limits and Structures in Graph Theory