u r saying which of the following............... where are options

The Gateway to Computer Science Excellence

0 votes

A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?

52,221 questions

59,854 answers

201,036 comments

118,098 users