collaborators

13 papers

math.CO2026

On the Determinant of Kőnig-Egerváry Graphs

Kevin Pereyra

Several graph decompositions that factorize the determinant of the adjacency matrix isolate a Kőnig-Egerváry part, such as the SD--KE decomposition and the critical independence de…

math.CO2026

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…

math.CO2026

Structural and Polynomial-Time Results on Core and Corona in Odd-Bicyclic Graphs

Kevin Pereyra

Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph . In this work, we show that for a graph with at mo…

math.CO2026

Core and Corona in 2-Bicritical Odd-Bicyclic Graphs

Kevin Pereyra

Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph . A graph is called \emph{-bicritical} if $\a{N(…

math.CO2026

A characterization of graphs with $\a{\corona G}+\a{\core G}=2α(G)+1$

Kevin Pereyra

A Kőnig--Egerváry graph is a graph satisfying , where , , and denote the independence number, the matching number, and the order of , resp…

math.CO2026

On the minimum degree of minimal --factor critical -planar graphs

Kevin Pereyra

A graph of order is said to be -\emph{factor-critical} if the removal of any vertices results in a graph with a perfect matching. A -factor-critical grap…