IndependentEdgeSetQ

IndependentEdgeSetQ[g, elist] yields True if the edge list elist is an independent edge set of the graph g, and False otherwise.

Examples

IndependentEdgeSetQ[CompleteGraph[4], {1 <-> 2, 3 <-> 4}]

IndependentEdgeSetQ[CycleGraph[5], {1 <-> 2, 2 <-> 3}]

Please visit the official Wolfram Language Reference for more details.