Can someone help me understand this problem?
The question asks: For the following three graphs,
(a) compute the sum of the degrees of all the vertices,
(b) count the number of edges and look for a pattern for how the answers to (a) and (b) are related.
The graph is below
I have no idea how to solve for sum of degrees when there are no numbers given in that graph. Additionally, the materials I am reading on sum of degrees is difficult to comprehend. I would love to get a Layman's term style of understanding how to go about solving this problem.
Best Answer
The degree of a node is th number of connected lines. Look at the following picture to got a feeling for what I mean. The upper red node is of degree two because two lines (edges) are connected. The middle green one is of degree three, because it touches three lines.