7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Home Graph Theory DBMS Control System Data Structure Selenium Kotlin C# HTML CSS JavaScript jQuery

Advertisement

https://www.javatpoint.com/graph-theory-coverings 1/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Coverings
A graph covering of a graph G is a sub-graph of G which contains either all the vertices or all the edges corresponding to some
other graph.

A sub-graph which contains all the vertices is called a line/edge covering. A sub-graph which contains all the edges is called a
vertex covering.

1. Edge Covering
A set of edges which covers all the vertices of a graph G, is called a line cover or edge cover of G.

Edge covering does not exist if and only if G has an isolated vertex.

Advertisement

Edge covering of graph G with n vertices has at least n/2 edges.

https://www.javatpoint.com/graph-theory-coverings 2/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Example

In the above graph, the red edges represent the edges in the edge cover of the graph.

Minimal Line covering

A line covering M of a graph G is said to be minimal line cover if no edge can be deleted from M.

Or minimal edge cover is an edge cover of graph G that is not a proper subset of any other edge cover.

No minimal line covering contains a cycle.

Example
Advertisement

https://www.javatpoint.com/graph-theory-coverings 3/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

From the above graph, the sub-graph having edge covering are:

M1 = {{a, b}, {c, d}}

M2 = {{a, d}, {b, c}}
M3 = {{a, b}, {b, c}, {b, d}}
M4 = {{a, b}, {b, c}, {c, d}}

Here, M1, M2, M3 are minimal line coverings, but M4 is not because we can delete {b, c}.

Minimum Line Covering

A minimal line covering with minimum number of edges is called a minimum line covering of graph G. It is also called smallest
minimal line covering.

PRICE DROP

Advertisement

₹10,490 ₹36,190 ₹14,940

The Sleep Company Mattress
The Sleep Company

Every minimum edge cover is a minimal edge cove, but the converse does not necessarily exist.

The number of edges in a minimum line covering in G is called the line covering number of G and it is denoted by α1.
https://www.javatpoint.com/graph-theory-coverings 4/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Example

From the above graph, the sub-graph having edge covering are:

M1 = {{a, b}, {c, d}}

M2 = {{a, d}, {b, c}}
M3 = {{a, b}, {b, c}, {b, d}}
M4 = {{a, b}, {b, c}, {c, d}}

In the above example, M1 and M2 are the minimum edge covering of G and α1 = 2.

2. Vertex Covering Advertisement

A set of vertices which covers all the nodes/vertices of a graph G, is called a vertex cover for G.

https://www.javatpoint.com/graph-theory-coverings 5/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Gated Community Plots

Oragadam
DTCP Approved Premium Plots in 130
Acres of Gated Community @
Oragadam. Prices from ₹ 9 L.

SIS Golden Gate, Oragadam Open

Example

In the above example, each red marked vertex is the vertex cover of graph. Here, the set of all red vertices in each graph touches
every edge in the graph. Advertisement

Minimal Vertex Covering

A vertex M of graph G is said to be minimal vertex covering if no vertex can be deleted from M.

https://www.javatpoint.com/graph-theory-coverings 6/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Chennai OPEN 9AM–8:30PM

Survey No: 458/3, 4, Next to…
Example

The sub- graphs that can be derived from the above graph are:

M1 = {b, c}
M2 = {a, b, c}
M3 = {b, c, d}

Here, M1 and M2 are minimal vertex coverings, but in M3 vertex 'd' can be deleted. Advertisement

Minimum Vertex Covering

A minimal vertex covering is called when minimum number of vertices are covered in a graph G. It is also called smallest minimal
vertex covering.

https://www.javatpoint.com/graph-theory-coverings 7/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

The number of vertices in a minimum vertex covering in a graph G is called the vertex covering number of G and it is denoted by
α2 .

Example 1

In the above graphs, the vertices in the minimum vertex covered are red.

α2 = 3 for first graph.

And α2 = 4 for the second graph.

Example 2

Advertisement

The sub- graphs that can be derived from the above graph are:

https://www.javatpoint.com/graph-theory-coverings 8/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

M1 = {b, c}
M2 = {a, b, c}
M3 = {b, c, d}

Here, M1 is a minimum vertex cover of G, as it has only two vertices. Therefore, α2 = 2.

Gated Community Plots

Oragadam
DTCP Approved Premium Plots in 130
Acres of Gated Community @
Oragadam. Prices from ₹ 9 L.

SIS Golden Gate, Oragadam Open

Advertisement

← Prev Next →

https://www.javatpoint.com/graph-theory-coverings 9/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Gated Community Plots

Oragadam
DTCP Approved Premium Plots in 130
Acres of Gated Community @
Oragadam. Prices from ₹ 9 L.

SIS Golden Gate, Oragadam Open

For Videos Join Our Youtube Channel: Join Now

Feedback

Send your Feedback to [email protected]

Help Others, Please Share Advertisement

https://www.javatpoint.com/graph-theory-coverings 10/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Villa Plots in Oragadam

Ready-to-Build Premium Plots at Oragadam - India's FIRST

Recreational City near Oragadam.

SIS Golden Gate, Oragadam Open

Learn Latest Tutorials

Splunk SPSS Swagger Transact-SQL Tumblr

Advertisement

ReactJS Regex Reinforcement R Programming RxJS

Learning

React Native Python Pillow Python Turtle Keras

https://www.javatpoint.com/graph-theory-coverings 11/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Python Design
Patterns

Preparation

Aptitude Reasoning Verbal Ability Interview Questions Company Questions

Trending Technologies

Artificial AWS Selenium Cloud Computing Hadoop

Intelligence

ReactJS Data Science Angular 7 Blockchain Git Tutorial

Tutorial Tutorial Tutorial Tutorial Advertisement
Git
ReactJS Data Science Angular 7 Blockchain

Machine DevOps
Learning Tutorial Tutorial
Machine Learning DevOps

https://www.javatpoint.com/graph-theory-coverings 12/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

B.Tech / MCA

DBMS tutorial Data Structures DAA tutorial Operating Computer

tutorial System Network tutorial
DBMS DAA
Data Structures Operating System Computer Network

Advertisement

Compiler Computer Discrete Ethical Hacking Computer

Design tutorial Organization and Mathematics Graphics Tutorial
Ethical Hacking
Architecture Tutorial
Compiler Design Computer Graphics
Computer Discrete
Organization Mathematics

https://www.javatpoint.com/graph-theory-coverings 13/14
7/19/23, 11:51 AM Graph Theory Coverings - javatpoint

Software html tutorial Cyber Security Automata C Language

Engineering tutorial Tutorial tutorial
Web Technology
Software Cyber Security Automata C Programming
Engineering

C++ tutorial Java tutorial .Net Python tutorial List of

Framework Programs
C++ Java Python
tutorial
Programs
.Net

Control Data Mining Data

Systems tutorial Tutorial Warehouse
Tutorial
Control System Data Mining
Data Warehouse

Advertisement

https://www.javatpoint.com/graph-theory-coverings 14/14