Extensions of Barrier Sets to Nonzero Roots of the Matching Polynomials
classification
🧮 math.CO
keywords
barriersetsthetagraphmatchingbeenbergecharacterization
read the original abstract
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define $\theta$-barrier sets. Our definition of a $\theta$-barrier set is slightly different from that of a barrier set. However we show that $\theta$-barrier sets and barrier sets have similar properties. In particular, we prove a generalized Berge's Formula and give a characterization for the set of all $\theta$-special vertices in a graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.