[Discrete Mathematics] Vertex Degree and Regular Graphs

Why tf is my thingy not thingying

what does odd no. of odd degrees even mean

thank you so much brother, this is one hell of a help

Can u please mention the video number which helps us to see full chapter one after the other ?

In the part about hypercubes, I think that you accidentally added one to each binary number; it's actually 0 through 7, not 1 through 8.

Thank you, your explanation is very clear and easy to understand

Consider an undirected graph G that has n distinct vertices where each vertex has degree 2. Assume n≥3. What is the maximum number of circuits that G can contain? If all the vertices of G are contained in a single circuit, what is the maximum number of vertices that can be contained in an independent set?

Thank you for this wonderful videos .

With your knowledge of Discrete Mathematics am sure you know so much about Database Management System or Networking.
If you do, please also make some videos teaching them .

I left Maths like almost 14 years after ago and your channels has really been helpful to me since last 2018.

Wish me luck for my "degree" : |

Does deg ^- (v) mean odd
and deg ^+ (v) mean even?

you are an angel for a computer science student

"in a simple graph, must every vertex have degree that is less than the number of vertices in the graph"

Thank You for the discrete mathematics playlist. It's so damn helpful! I love it!
Do you have a video which covers vertices degrees of directed graphs??

dude why does this make so much sense when the textbook reads like I found a mandarin translation to create the Philosopher's Stone? ( For those that can read both English and Mandarin, sub in cuneiform or some equally difficult language to read)

Did you fail to mention that it is called handshake theorem or have you mentioned it somewhere else?

What is the degree of a loop in a directed graph? Is it 1? Thanks

thank you very helpful