Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Maximal Matching

    Alternate name
    Definition

    A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a maximal independent edge set is not equivalent to a maximum independent edge set, which is an independent edge set containing the largest possible number of edges among all independent edge sets. A maximum independent edge set is always maximal, but the converse does not hold. A maximal independent edge set of a graph can be computed in the Wolfram Language using FindIndependentEdgeSet[g].

    Related Wolfram Language symbol

    FindIndependentEdgeSet

    Back to List | POWERED BY THE WOLFRAM LANGUAGE