MaximalIndependentVertexSet

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

MaximalIndependentVertexSet[g]
gives a maximal independent vertex set of an undirected graph g.


gives a maximal independent vertex set of g with vertices weighted by w.

DetailsDetails

  • MaximalIndependentVertexSet functionality is now available in the built-in Wolfram Language function FindIndependentVertexSet.
  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • gives an (approximate) maximal set of vertices such that no two vertices form an edge. It treats the input as an undirected graph.
  • The length of the vector w must be the same as the number of vertices in g.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

In[1]:=
Click for copyable input

This specifies a small graph:

In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=

This shows that the maximal independent vertex set contains three vertices:

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

has been superseded by FindIndependentVertexSet:

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