- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- 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.
Updated 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
- Change the color of X-axis line for a graph using ggplot2.
- 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++
- How to increase the width of the X-axis line for a ggplot2 graph?
- 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
Advertisements