Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Covers and Independent Sets > IndependentEdgeSetQ >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Covers and Independent Sets > IndependentEdgeSetQ >

IndependentEdgeSetQ

IndependentEdgeSetQ
yields True if the edge list elist is an independent edge set of the graph g, and False otherwise.
  • 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.
Test whether a set of edges is an independent edge set:
Test for a directed graph:
Test whether a set of edges is an independent edge set:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Test for a directed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Test undirected graphs:
Enumerate all independent edge sets for a cycle graph:
Enumerate all subsets of edges and select the independent edge sets:
Highlight independent sets:
Enumerate all maximal independent edge sets for a wheel graph:
Find the length of a maximal independent edge set:
Enumerate all edge subsets of length 2 and select the independent edge sets:
Highlight maximal independent sets:
A largest independent edge set can be found using FindIndependentEdgeSet:
Bipartite graphs have independent edge sets and vertex covers of equal length:
For a graph without isolated vertices, the sum of the size of the independent edge set and the size of the edge cover equals the number of vertices:
New in 8
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF