8 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 the…
A Ridge-Saturation Characterization of -Critical Graphs
Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu +1
We characterize the graphs which are simultaneously -critical and members of the class . The characterization is stated in three equivalent languages. In the graph…
Graphs with core(G) = nucleus(G)
Vadim E. Levit, Eugen Mandrescu, Kevin Pereyra
Let be a finite simple graph. An independent set of is critical if for every independent set o…
The family of all local maximum independent sets is an augmentoid
Vadim E. Levit, Eugen Mandrescu
It was proved in (Levit and Mandrescu, 2022) that both and are augmentoids, established partial augmentation phenomena for the family $Ψ(…
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…
Structural properties and characterizations of class
Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu
We establish new characterizations of graphs belonging to the class. In addition, we characterize locally triangle-free -critical graphs in this class. As a cons…