2 citations · 7 across the 11 of their papers we have counts for
16 papers
Generalized Sterboul--Deming Configurations
Daniel A Jaume, Cristian Panelo, Kevin Pereyra
Sterboul and Deming gave classical matching-based characterizations of non-Kőnig--Egerváry graphs through flower--posy and blossom-pair configurations. We consider two classical co…
Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs
Daniel A. Jaume, Cristian Panelo, Kevin Pereyra
We introduce two new types of graph configurations, the Jflower and the Jposy, which generalize the classical flower and posy configurations of Edmonds, Sterboul, and Deming in the…
2-switch: transition and stability on forests and pseudofests
Victor N. Schvöllner, Adrián Pastine, Daniel A. Jaume
Given any two forests (pseudoforests) with the same degree sequence, we show that one can be transformed into the other by a sequence of 2-switches in such a way that all the inter…
Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
Daniel A. Jaume, Diego G. Martinez, Cristian Panelo +1
In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of…
On the nullspace of split graphs
Daniel A. Jaume, Victor N. Schvöllner, Cristian Panelo +1
We study the nullspace of the adjacency matrix of split graphs, whose vertex set can be partitioned into a clique and an independent set. We introduce the clique-kernel, a subspace…
2-switch transition on unicyclic graphs and pseudoforest
Daniel A. Jaume, Adrián Pastine, Victor Schvöllner
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into t…