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

FindEdgeCover

FindEdgeCover[g]
finds an edge cover of the graph g with a minimum number of edges.
  • 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.
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]=
FindEdgeCover works with undirected graphs:
Directed graphs:
Works with large graphs:
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