- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# 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 = (α_{1}) ≥ ⌈ *n* 2 ⌉ = 3

α_{1} ≥ 3

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

Hence, the line covering number is 3.

- Related Articles
- Finding the matching number of a graph
- Finding the chromatic number of complete graph
- Finding the number of spanning trees in a graph
- Finding the number of regions in the graph
- Line/Edge Covering
- Finding the Parity of a number Efficiently in C++
- Finding the number of words in a string JavaScript
- Finding longest line of 1s in a matrix in JavaScript
- Finding the simple non-isomorphic graphs with n vertices in a graph
- What does a straight line graph indicates?
- C++ Program to Perform Edge Coloring to the Line Graph of an Input Graph
- Change the color of X-axis line for a graph using ggplot2.
- Finding the largest prime factor of a number in JavaScript
- Finding place value of a number in JavaScript
- Finding number of spaces in a string JavaScript

Advertisements