Use Exercise43 to show that a simple graph with n vertices and it connected components has at most (n - k)(n - k+1)/2edges. [Hint: First show that
where niis the number of vertices in the ith connected component.]
Want to see the full answer?
Check out a sample textbook solutionChapter 10 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageElementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,