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 > FindEdgeCover >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Covers and Independent Sets > FindEdgeCover >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

FindEdgeCover

FindEdgeCover[g]
finds an edge cover of the graph g with a minimum number of edges.
MORE INFORMATION
  • FindEdgeCover will return an empty list if no edge cover is found.
  • An edge cover is a set of edges that is incident to every vertex.
EXAMPLESCLOSE ALL
Basic Examples   (2)
Find an edge cover in a complete graph:
Find an edge cover in a directed graph:
Find an edge cover in a complete graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Find an edge cover in a directed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Scope   (3)
FindEdgeCover works with undirected graphs:
Directed graphs:
Works with large graphs:
Properties & Relations   (5)
The edges in an edge cover are incident to every vertex:
Test whether a set of edges is an edge cover using EdgeCoverQ:
For a connected graph, the sum of the size of an independent edge set and an edge cover equals the vertex count:
The complete bipartite graph has edge covering number :
An edge cover of a StarGraph includes all its edges:
New in 8
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF