Given the number of vertices N of a graph. The task is to determine the Edge cover.
Edge Cover: Minimum number of edge required to cover all vertex is known as Edge Cover.
Input : N = 5 Output : 3 Input : N = 4 Output : 2
Example 1: For N = 5 vertices,
Edge Cover is: 3 (Choosing the edges marked in Red, all of the vertices will get covered)
Example 2: For N = 8 vertices,
Edge Cover is: 4 (Choosing the edges marked in Red, all of the vertices will get covered)
Edge Cover = ceil (no. of vertices / 2)
Below is the implementation of the above approach:
- Edge Coloring of a Graph
- Check if removing a given edge disconnects a graph
- Add and Remove Edge in Adjacency List representation of a Graph
- Maximize number of nodes which are not part of any edge in a Graph
- Shortest Path in a weighted Graph where weight of an edge is 1 or 2
- Tree, Back, Edge and Cross Edges in DFS of Graph
- Maximum Possible Edge Disjoint Spanning Tree From a Complete Graph
- Finding minimum vertex cover size of a graph using binary search
- Calculate number of nodes between two vertices in an acyclic Graph by Disjoint Union method
- Program to calculate value of nCr
- Program to calculate age
- Program to calculate the value of sin(x) and cos(x) using Expansion
- Program to calculate Root Mean Square
- Program to calculate Profit Or Loss
- Program to Calculate the Perimeter of a Decagon
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.