Abstract

In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to their connection to maximum matchings in a graph. For a root θ of the matching polynomial, we define θ -barrier and θ -extreme sets. We prove a generalized Berge–Tutte formula and give a characterization for the set of all θ -special vertices in a graph.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call