1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application
Ohr Kadrawi, Vadim E. Levit
Let be a finite simple graph. The annihilation number is an efficiently computable upper bound on the independence number . We develop a sharp matching-number theo…
Closing Trees into Unicyclic Counterexamples
Vadim E. Levit, Ohr Kadrawi
We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the e…
Inequalities Connecting the Annihilation and Independence Numbers
Ohr Kadrawi, Vadim E. Levit
Given a graph , the number of its vertices is represented by , while the number of its edges is denoted as . An independent set in a graph is a set of vertices where…
The independence polynomial of trees is not always log-concave starting from order 26
Ohr Kadrawi, Vadim E. Levit
An independent set in a graph is a collection of vertices that are not adjacent to each other. The cardinality of the largest independent set in is represented by . The i…
A Linear Algorithm for Computing Independence Polynomials of Trees
Ohr Kadrawi, Vadim E. Levit, Ron Yosef +1
An independent set in a graph is a set of pairwise non-adjacent vertices. Let denote the cardinality of a maximum independent set in the graph . Gutman and Harar…