Properties in Graph Theory: Complete, Connected, Subgraph, Induced Subgraph

We develop four ideas in graph theory:
Complete: every possible edge is included
Connected: there is a path from every vertex to every other;
Subgraph: A subset of the vertices and edges from an original graph
Induced Subgraph: A subset of the vertices and ALL relevant edges from an original graph

OTHER COURSE PLAYLISTS:

OTHER PLAYLISTS:
► Learning Math Series
►Cool Math Series:

BECOME A MEMBER:

MATH BOOKS & MERCH I LOVE:

SOCIALS:

[TinyMaths]

My god man! You should be given an award for your ability to give 'the simplest, most graspable' explanations. So clear.
I'm starting to believe that being good at math and being able to explain it effectively are two subsets that don't automatically intersect.

[thhokage]

intelligence is measured by one's ability to explain something in the simplest way possible. 10/10 video

[cHuss_TV]

This makes it seem like my professor is teaching the class in a different language, this is so much easier to understand

[zafer]

Thanks! The explanations are really clear!

[shimabegum]

Great video. I love it. But What is a node?

[benibensa]

Quick question, could a subgraph consist of two nonconnected graphs?