| Status |
|
Subject |
Created By |
Replies |
Views |
Last Post |
 |
|
|
vsiap |
0 |
372 |
by vsiap
Dec 1, 2014 17:08:47 GMT |
Board Information & Statistics
 |
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).
|
|
 |
| Threads and Posts |
|---|
| Total Threads: | 1 |
| Total Posts: | 1 |
|
|
 |
| On This Board |
|---|
| You can create threads. |
| You can reply to threads. |
| You can create polls. |
|
|
 |
| Users Viewing |
|---|
| 0 Staff, 0 Members, 1 Guest. |
| |
|
|
|
Thread
Announcement
Sticky
Locked
Poll
Bookmark
