Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
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 unimodular and singular matchable graphs.
math.CO↗