- An independent edge set is a set of edges that are never incident to the same vertex.
- An independent edge set is also known as a matching.
- IndependentEdgeSetQ works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
IndependentEdgeSetQ works with large graphs:
Properties & Relations (3)
A largest independent edge set can be found using FindIndependentEdgeSet:
Wolfram Research (2010), IndependentEdgeSetQ, Wolfram Language function, https://reference.wolfram.com/language/ref/IndependentEdgeSetQ.html (updated 2014).
Wolfram Language. 2010. "IndependentEdgeSetQ." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2014. https://reference.wolfram.com/language/ref/IndependentEdgeSetQ.html.
Wolfram Language. (2010). IndependentEdgeSetQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/IndependentEdgeSetQ.html