Status    Subject Created By Replies Views Last Post
Thread  
NewBookmarkLockedFalling Answer:
vsiap 0 138 by vsiap
Dec 1, 2014 17:08:47 GMT

Legend

Thread Announcement Sticky Locked New New Poll Bookmark

Board Information & Statistics

Board Description
Q29
Show that if a simple graph G has k connected components and these components have n1,n2,...,nk vertices, respectively, then the number of edges of G does not exceed
C(n1,2)+C(n2,2)+...+C(nk,2).
Board Statistics
Threads and Posts
Total Threads:1
Total Posts:1
Members
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.