Let G = (V, E) be a graph with n vertices and n - 1 edges. Prove that G either has a vertex of d

Name: Let G = (V, E) be a graph with n vertices and n - 1 edges. Prove that G either has a vertex of degree 1 or a vertex of degree 0.
Uploaded: 2021-11-09T14:43:27-08:00
Duration: 3 min 23 s
Channel: Likhit Ganedi
Description: Let G = (V, E) be a graph with n vertices and n - 1 edges. Prove that G either has a vertex of degree 1 or a vertex of degree 0.

Question

Drew Scalzo · Accepted Answer

1. Assume that G does not have a vertex of degree 1 or degree 0.

Question

Let G = (V, E) be a graph with n vertices and n - 1 edges. Prove that G either has a vertex of degree 1 or a vertex of degree 0.

Please give Ace some feedback