TEAM – 5

ARJUN RAGHUVIR BHANDARI 4SF20CS017

KUMAR RISHAV 4SF20CS054
PRAJWAL PRABHU N 4SF20CS087
SHETTY GAUTHAM JAGADISH 4SF20CS126
SUNIL KUMAR V DARMDHOL 4SF20CS162
 TOPIC :-
SUB - GRAPHS
 ❑ WHAT IS SUB-GRAPHS?
➢ GIVEN 2 GRAPHS (G) AND (G1) ,WE CAN SAY THAT (G1) IS A
SUBGRAPH OF (G) IF THE FOLLOWING CONDITION HOLD :-
o1. ALL THE VERTICES AND EDGES OF (G1) ARE IN (G).
o2. EACH EDGE OF (G1) HAS THE SAME END VERTICES IN (G) AS IN (G1).

➢EG.:-
V1 V2 V1 V2

V3

V5 V4 V5 V4

G G1
❑ TYPES OF SUB -
GRAPHS
 ❑ SPANNING SUB-GRAPH
➢ GIVEN A GRAPH G={V,E} , IF THERE IS A SUBGRAPH G1={V1,EB} OF
(G) SUCH THAT V1=V THEN (G1) IS CALLED SPANNING SUBGRAPH
OF G.

➢EG.:-

A A

B C B C B C

D D D

G G1 G2
 ❑ INDUCED SUB-GRAPH
➢ GIVEN A GRAPH G={V,E} , SUPPOSE THERE IS A SUBGRAPH
G1={V1,EB} OF (G) SUCH THAT EVERY EDGE {A,B} OF (G) , WHERE
(A,B) BELONGS TO (V1) IS AN EDGE OF (G1) ALSO. THEN (G1) IS
CALLED INDUCED SUBGRAPH OF G AND IS DENOTED BY <G1>.

➢EG.:-

V2 V3 V2 V1 V2

V1 V1 V3

V5 V4 V4 V5 V3

G1 G2
G
 ❑ EDGE DISJOINT SUB-GRAPH
➢LET (G) BE A GRAPH AND (G1) AND (G2) BE 2 SUB-GRAPHS OF (G)
THEN , (G1) AND (G2) ARE SAID TO BE EDGE DISJOINT IF THEY DO
NOT HAVE EDGE IN COMMON.
➢EG.:-

P Q P Q

R S T

S R T S R
G1 G2
G
 ❑ VERTEX DISJOINT SUB-GRAPH
➢LET (G) BE A GRAPH AND (G1) AND (G2) BE 2 SUB-GRAPHS OF (G)
THEN , (G1) AND (G2) ARE SAID TO BE VERTEX DISJOINT IF THEY
DO NOT HAVE ANY COMMON EDGE AND ANY COMMON
VERTICES.

➢EG.:-
P Q

P Q R S T

S R T
G1 G2
G
QUESTIONS –ANSWERS ON
SUB - GRAPHS
THANK YOU