Q.Which of the following can be a degree sequence of a simple graph? {4,4,3,2,1} {4,3,2,1} {4,4,3,2} {4,2,2,2,2} Q.If G is a connected simple graph and e,f and g are edges of G, then which of the following is/are true: There is always a spanning tree of G that contains e There is always a spanning tree of G that contains e and f There is always a spanning tree of G that contains e,f and g All of the above. Q.If G is a simple, disconnected graph on n vertices, how many maximum edges can it have? n−2 (n2) (n−12) (n−12)+1 Q.Which of the following statements is NOT true? The maximum number of cut vertices in any simple, connected graph on n vertices is n−2 If there exist a cut-edge in the graph, then a cut-vertex must also exist. If there exist a cut-vertex in the graph, then a cut-edge must also exist. The maximum number of cut-edges in any simple graph on n vertices is n−1.