Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Covers and Independent Sets > FindIndependentVertexSet >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Covers and Independent Sets > FindIndependentVertexSet >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

FindIndependentVertexSet

FindIndependentVertexSet[g]
finds an independent vertex set of the graph g with a maximum number of vertices.
MORE INFORMATION
  • An independent vertex set is a set of vertices that are never incident to the same edge.
EXAMPLESCLOSE ALL
Basic Examples   (2)
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]=
Scope   (2)
FindIndependentVertexSet works with undirected graphs:
Directed graphs:
Properties & Relations   (4)
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
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF