Assap tutors guide on this question please thankyou.
14. A graph with all vertices having equal degree is known as a a) Multi Graph b) Regular Graph c) Simple Graph d) Complete Graph 15. Which of the following ways can be used to represent a graph? a) Adjacency List and Adjacency Matrix b) Incidence Matrix c) Adjacency List, Adjacency Matrix as well as Incidence Matrix d) No way to represent 12. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true? a) v=e b) v = e+1 c) v + 1 = e d) v = e-1 13. For which of the following combinations of the degrees of vertices would the connected graph be eulerian? a) 1,2,3 b) 2,3,4 c) 2,4,5 d) 1,3,511. Which of the following is true? a) A graph may contain no edges and many vertices b) A graph may contain many edges and no vertices c) A graph may contain no edges and no vertices d) A graph may contain no vertices and many edges 12. For a given graph G haying v vertices and e edges which is connected and has no cycles, which of the following statements is true? a)y=e b) V = e+1 Qv+1=e d) v = e1 10. What is the maximum number of edges in a bipartite graph having 10 vertices? a)24 b) 21 c) 25 d) 16 9. Which of the following properties does a simple graph not hold? 3) Must be connected b) Must be unweighted c) Must have no loops or multiple edges d) Must have no multiple edges 7. A connected planar graph having 6 vertices, 7 edges contains regions. a) 15 b) 3 C) 1 d) 11 Answer: b Explanation: By euler's formula the relation between vertices(n), edges(q) and regions(r) is given by n-q+r= 2. 8. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is a) (n*n-n-2*m)/2 b) (n*n+n+2*m)/2 c) (n*n-n-2*m)/2 d) (n*n-n+2*m)/26. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. a) True b) False \f1. Which of the following statements for a simple graph is correct? a) Every path is a trail b) Every trail is a path c) Every trail is a path as well as every path is a trail d) Path and trail have no relation 3. For the given graph(G), which of the following statements is true? A B D C E a) G is a complete graph b) G is not a connected graph c) The vertex connectivity of the graph is 2 d) The edge connectivity of the graph is 1 4. What is the number of edges present in a complete graph having n vertices? a) (n*(n+1))/2 b) (n * (n-1))/2 c) n d) Information given is insufficient
