Tessellate S.T.E.M.S - Mathematics - School - Set 2 - Problem 4

Which of the following can be degrees of vertices of a graph with 7 7 vertices?


This problem is a part of Tessellate S.T.E.M.S.

0, 3, 2, 1, 0, 2, 2 0, 1, 2, 3, 4, 3, 2 0, 3, 0, 2, 3, 1, 2 1, 1, 1, 2, 2, 2, 2

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Sutirtha Datta
Jan 2, 2018

For an undirected graph G = ( V , E ) G =(V, E)

d = 2 e \sum d = 2e

Where d is degree of each vertices and e is the number of edges.

Therefore the sum must be even which corresponds to only c.

Jerry McKenzie
Jan 1, 2018

The sum of the degrees of vertices must be odd, since each connection must have 2 sides.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...