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.]
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Chapter 10 Solutions
DISCRETE MATHEMATICS LOOSELEAF
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageElementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337614085/9781337614085_smallCoverImage.jpg)