#6 Theorem: A Graph G is disconnected if and only if its vertex set V can be | Graph Theory in Tamil

[@jaanushanp2985]

Let 𝐺 be an undirected graph with a loop at every vertex. Show that the relation R on the set
of vertices of G such that 𝑢𝑅𝑣 if and only if there is an edge associated to {𝑢, 𝑣}is a symmetric,
reflexive relation on 𝐺.

[@akilankabilan2929]

Nice explanation..... Superb....

[@akilankabilan2929]

Mam intha 25 videos ah mattum paatha GTA la 2 units questions attend pannidalama..?

[@giridharannv9948]

ithula 2 units topics than cover airuka ?

[@VinothKumar-no9nj]

I am studying BE 7th semester.. Tomorrow gta exam mam.. watching ur videos now..

[@WELCOMEENGINEERS]

Keep Watching. Thank you

[@uppukaruvadu6871]

Like panniyachi

[@WELCOMEENGINEERS]

Thank you

[@uppukaruvadu6871]

@@WELCOMEENGINEERS akka neenga staff ahh

[@vanithamanik2881]

I am fresher for trb polytechnic exam. I completed M.Sc., (Maths). How to prepare for this exam

[@amarnath-cf7zi]

Show that there is no such thing as a graph G with 500 vertices, in which half of the vertices have degree 480 and the other half have degree 2.

[@Thisakaran_Rasalingam]

❤️💥💯

[@WELCOMEENGINEERS]

Thank you 😊. Keep watching and support our channel by share our videos with your friends

[@CSB-ROSHIKAR]

Mam use graph for better understanding