Size of Tree Graph Complement equals Size of a Complete Graph | Graph Theory

preview_player
Показать описание
How many edges does the complement of a tree graph have? We'll be answering this question in today's graph theory video lesson using the fact that a tree of order n has n-1 edges, that is - a size of n-1. Knowing this, we can easily find an expression for the size of the complement of a tree graph, by subtracting (n-1) from the total number of possible edges on n vertices. Then, we will show this is actually the same as the size of a complete graph on n-1 vertices.

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...

Рекомендации по теме
Комментарии
Автор

Really enjoyed the explaination Sean. Could you do a video related to spanning trees and spanning subgraphs in the future if possible.

sahilshetty
Автор

Hello, are you planning on doing a video about calculating an average from a frequency table?

soggy.