Status    Subject Created By Replies Views Last Post
No threads were found.

Board Information & Statistics

Board Description
Use Exercise 29 to show that a simple graph with n vertices and k connected components has at most (n − k)(n − k + 1)/2 edges. [Hint: First show that
where ni is the number of vertices in the ith connected component.]
Board Statistics
Threads and Posts
Total Threads:0
Total Posts:0
On This Board
You can create threads.
You can reply to threads.
You can create polls.
Members Online
Users Viewing
0 Staff, 0 Members, 1 Guest.