Saved Bookmarks
| 1. |
How many edges are there in a graph with 10 vertices each of degree 5? |
Answer» the sum of the degrees of the vertices is 6 ⋅ 10 = 60. The HANDSHAKING THEOREM says 2m = 60. So the number of edges is m = 30. Example: If a graph has 5 vertices, can each vertex have degree 3? |
|