IndependentEdgeSetQ

IndependentEdgeSetQ[g,elist]

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

Details

  • 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.

Examples

open allclose all

Basic Examples  (1)

Test whether a set of edges is an independent edge set:

In[1]:=
Click for copyable input
Out[1]=

Scope  (5)

Applications  (2)

Properties & Relations  (3)

See Also

FindIndependentEdgeSet  IndependentVertexSetQ

Introduced in 2010
(8.0)
| Updated in 2014
(10.0)