Exercise · ZW-DEGREE-OF-A-VERTEX-005 · ★★☆ Intermediate

Which of these lists can be the degree list of a simple graph?

Choose one option.

Show answer
  • B. 3, 3, 2, 2

Explanation

It comes from removing one edge from a complete graph on 4 vertices. 3,3,3,1 is impossible (three vertices of degree 3 touch the fourth); 3,2,2 has odd sum; in 4,2,2,1 a vertex of degree 4 would need 5 vertices.

Study Discrete mathematics in ZWMath →

Review the concept: Degree of a vertex

The degree \(\deg(v)\) of a vertex \(v\) is the number of edges of the graph (the set \(E\)) that have it as an endpoint.

\[\deg(v)=\bigl|\{e\in E:\ v\in e\}\bigr|\]

More practice problems: degree of a vertex

← ZW-DEGREE-OF-A-VERTEX-004 ZW-DEGREE-OF-A-VERTEX-006 →