This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)

FindIndependentVertexSet

FindIndependentVertexSet[g]
finds an independent vertex set of the graph g with a maximum number of vertices.
  • An independent vertex set is a set of vertices that are never incident to the same edge.
Find an independent vertex set in a complete graph:
Find an independent vertex set in a directed graph:
Find an independent vertex set in a complete graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Find an independent vertex set in a directed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
FindIndependentVertexSet works with undirected graphs:
Directed graphs:
Test whether a set of vertices is an independent vertex set using IndependentVertexSetQ:
The complement of an independent vertex set is a vertex cover:
The complement subgraph given by an independent vertex set is complete:
Bipartite graphs have equal-length edge covers and independent vertex sets:
New in 8