DOCUMENTATION CENTER SEARCH
Graph Utilities Package
>
Graph Utilities
Package Symbol
Graph Utilities Package
Tutorials »
|
MaximalBipartiteMatching
MaximalIndependentVertexSet
See Also »
|
Graph Utilities Package
More About »
MaximalIndependentEdgeSet
MaximalIndepndentEdgeSet[
g
]
gives a maximal independent edge set of an undirected graph
g
.
MORE INFORMATION
To use
MaximalIndependentEdgeSet
, you first need to load the
Graph Utilities Package
using
Needs
["GraphUtilities`"]
.
MaximalIndependentEdgeSet
gives an approximate maximal set of pairwise non-adjacent edges of
g
.
A maximal independent edge set of a graph is also called a maximal matching.
The following option can be given:
Weighted
False
whether edges with higher weights are preferred when forming the maximal independent edge set
EXAMPLES
CLOSE ALL
Basic Examples
(1)
Needs["GraphUtilities`"]
This defines a small graph:
In[2]:=
In[3]:=
Out[3]=
This shows that the maximal independent edge set contains three edges:
In[4]:=
Out[4]=
This plots the hexagon with maximal edges highlighted in red:
In[5]:=
Out[5]=
Options
(1)
Applications
(1)
SEE ALSO
MaximalBipartiteMatching
MaximalIndependentVertexSet
TUTORIALS
Graph Utilities Package
MORE ABOUT
Graph Utilities Package
© 2008 Wolfram Research, Inc.
EXAMPLES
Basic Examples 
Options 