Finding the line covering number of a graph

Problem Statement

What is the line covering number for the following graph?

Solution

Number of vertices = |V| = n = 7

Line covering number = (α₁) ≥ ⌈ n / 2 ⌉ = 3

α₁ ≥ 3

By using 3 edges, we can cover all the vertices.

Hence, the line covering number is 3.

Mahesh Parahar

Published on 23-Aug-2019 07:25:32

• Related Questions & Answers
• Finding the matching number of a graph
• Line/Edge Covering
• Finding the chromatic number of complete graph
• Finding the number of spanning trees in a graph
• Finding the number of regions in the graph
• Vertex Covering
• C++ Program to Perform Edge Coloring to the Line Graph of an Input Graph
• Finding the number of words in a string JavaScript
• Finding the Parity of a number Efficiently in C++
• Finding longest line of 1s in a matrix in JavaScript
• Python - Plot a Pandas DataFrame in a Line Graph
• Finding the largest prime factor of a number in JavaScript
• Finding the simple non-isomorphic graphs with n vertices in a graph
• Finding place value of a number in JavaScript
• Finding number of spaces in a string JavaScript