A graph is called simple if each edge connects two different vertices (no self-loops), and no two edges connect the same pair of vertices (no multiple/parallel edges).

A simple undirected graph =(,)G=(V,E) has the property that the sum of the degrees of all the vertices is twice the number of vertices.

Select one:

a. True

b. False