Abstract

AbstractA fractional matching of a graph G is a function f that assigns to each edge a number in [0, 1] such that, for each vertex v, ∑ f(e) ≤ 1, where the sum is taken over all edges incident to v. The fractional matching number of G is the supremum of ∑e∈E(G) f(e) over all fractional matchings f. In this paper, we provide a new formula for calculating the fractional matching numbers of graphs using the Gallai–Edmonds Structure Theorem. Thus, we characterize graphs for which the fractional matching number equals the matching number and graphs for which the fractional matching number is the maximum possible (one‐half the number of vertices). © 2002 Wiley Periodicals, Inc.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.