Комментарии:
These are better than the videos my professor posts. Thank you so much
ОтветитьWait, complete graph without loop(s) but they're definitely graph with all the vertices connected, so the number of edge is combination(v,2). But why you draw that K4 only with 5 edges, not 6?
ОтветитьLiving on the edge be like
ОтветитьHow many sub-graph does Kn? 🤔 Please
ОтветитьIt's a bunch of jargon!
ОтветитьDamn these lectures are so ''edgy''.
ОтветитьThank you sir.. You can explain better than my College lecturer.. Very Helpful !!
ОтветитьThank you for posting these videos. They are helping me tremendously.
ОтветитьQuestion about compliments
Can I say that taking the compliment of a graph is just getting rid of the edges that are there, but adding the ones that aren't? You probably said it, but I think I got confused... Sorry