What is a Complete Graph? | Graph Theory

What is a complete graph? That is the subject of today's lesson! A complete graph can be thought of as a graph that has an edge everywhere there can be an edge. This means that a graph is complete if and only if every pair of distinct vertices in the graph is joined by an edge. So if, in a graph, there two vertices that are not adjacent (joined by an edge), then the graph is not complete. If, in a graph, all vertices are adjacent (every pair of distinct vertices is joined by an edge), then the graph is complete.

I hope you find this video helpful, and be sure to ask any questions down in the comments!

+WRATH OF MATH+

Follow Wrath of Math on...

[WrathofMath]

Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions!

[mr.hibster]

Thank you so much bro. There are no quality videos for graph theory in utube until now!!

[andreasteguhsantosokosasih]

this video really helpful for me bro, thanks

[PunmasterSTP]

What's complete is the quality of these videos!

[aflyingtoaster]

can you please do a video on Dijkstra Algorithm

[faizannahmad]

sir i have a confusion you say that a graph with zero vertex is complete graph but i read in a book that a graph cannot have zero vertex and zero vertex is not possible edges may have zero.
if zero vertex of a graph is possible than how?

[muhibshawon]

How many edges in the complete bipartite graph, K50, 60.
what will the answer? and what is the process?

[vartika_singh]

Then what is the difference between complete and connected graph?

[_zerox_X]

Also a complete graph is (n-1) regular 😉