For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is Data Structures 4 July 20204 July 2020StudyBlocksLeave a Comment on For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex isa) ne b) 2nc) 2ed) e^n