Scribd
Upload
13 views8 pages

MTH401 unit_04 & 05 Mock paper (1)

This document is a mock paper for the subject Graph Theory I & II at Lovely Professional University, containing 30 multiple-choice questions. The questions cover various topics in graph theory, including types of graphs, properties, algorithms, and expressions. Answers to the questions are provided at the end of the document.

Uploaded by

Aditya Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views8 pages

MTH401 unit_04 & 05 Mock paper (1)

This document is a mock paper for the subject Graph Theory I & II at Lovely Professional University, containing 30 multiple-choice questions. The questions cover various topics in graph theory, including types of graphs, properties, algorithms, and expressions. Answers to the questions are provided at the end of the document.

Uploaded by

Aditya Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Lovely Professional University

Mock Paper – Graph Theory I & II


Subject Code: MTH401

Q1. A graph with an edge between every pair of vertices is called:

A. Cycle graph
B. Bipartite graph
C. Regular graph
D. Complete graph

Q2. How many edges are there in a complete graph with n vertices?

A. n
B. n(n−1)
C. n(n−1)/2
D. 2n

Q3. A graph in which each vertex has the same degree is called:

A. Regular graph
B. Bipartite graph
C. Directed graph
D. Weighted graph

Q4. A cube graph has how many vertices in an n-dimensional cube?

A. 2n
B. n^2
C. 2^2
D. n!

Q5. Which of the following is always bipartite?

A. Complete graph
B. Cycle graph with even vertices
C. Cycle graph with odd vertices
D. Wheel graph
Q6. A wheel graph has:

A. A cycle with a central vertex connected to all others


B. All edges connected to one central vertex
C. No cycles
D. Only parallel edges

Q7. In an undirected graph, the sum of all vertex degrees is:

A. Number of vertices
B. Twice the number of edges
C. Number of loops
D. Equal to number of edges

Q8. A path where no edge is repeated is called:

A. Simple path
B. Euler path
C. Circuit
D. Hamiltonian cycle

Q9. Which matrix represents whether an edge exists between two vertices?

A. Degree matrix
B. Incidence matrix
C. Adjacency matrix
D. Weight matrix

Q10. Two graphs are isomorphic if:

A. They have the same vertex labels


B. They look identical
C. There’s a 1-to-1 correspondence of vertices and edges
D. They have same number of vertices
Q11. Which of the following is not true for a simple graph?

A. No self-loops
B. At most one edge between vertices
C. Contains only directed edges
D. No multiple edges

Q12. In a digraph, the number of incoming edges to a vertex is called:

A. Out-degree
B. In-degree
C. Total degree
D. Degree

Q13. A graph is connected if:

A. Every pair of vertices is joined by a path


B. All degrees are even
C. It has no loops
D. It is undirected

Q14. Dijkstra’s algorithm works only if:

A. Graph is unweighted
B. Graph has negative weights
C. All weights are positive
D. It's a tree

Q15. In an adjacency matrix of an undirected graph, the matrix is:

A. Upper triangular
B. Lower triangular
C. Symmetric
D. Antisymmetric

Q16. Euler’s formula for a connected planar graph is:

A. V+E=F
B. V−E+F=2
C. V+E+F=2
D. V+F=2E

Q17. Which graph is not planar?

A. K4
B. K(3,3)
C. C(5)
D. Tree

Q18. A planar graph can be drawn in a plane:

A. With no edge crossings


B. With no loops
C. With equal edges
D. With parallel edges

Q19. Chromatic number of a graph is:

A. Number of edges
B. Number of loops
C. Minimum number of colors to color vertices
D. Number of regions

Q20. What is the chromatic number of a cycle with odd number of vertices?

A. 2
B. 3
C. Depends on edges
D. 1

Q21. A tree is a:

A. Connected graph with no cycles


B. Graph with loops only
C. Disconnected graph
D. Planar graph only
Q22. Number of edges in a tree with n vertices is:

A. n
B. n−1
C. n+1
D. 2n

Q23. A rooted tree has:

A. One designated root node


B. All degrees equal
C. No leaf nodes
D. Cycles

Q24. A spanning tree of a graph:

A. Includes all vertices and is acyclic


B. Is a disconnected subgraph
C. Is always complete
D. Excludes at least one vertex

Q25. Which algorithm is used for minimum spanning tree?

A. Dijkstra’s
B. Bellman-Ford
C. Prim’s or Kruskal’s
D. Floyd-Warshall

Q26. Which is a property of any tree with more than one node?

A. It has at least two leaves


B. All vertices have same degree
C. Exactly one loop
D. All are isolated

Q27. Decision trees are mainly used for:

A. Classification
B. Shortest path
C. Connectivity
D. Bipartite check

Q28. Which of these expressions is in postfix notation?

A. A+B
B. +AB
C. AB+
D. A(B+C)

Q29. Infix expression A+BA + BA+B is equivalent to which prefix form?

A. AB+
B. +AB
C. A+B
D. B+A

Q30. Which of the following is true for any spanning tree?

A. It is a subgraph
B. It contains all vertices
C. It is acyclic
D. All of the above
Q.No Answer

1 D

2 C

3 A

4 C

5 B

6 A

7 B

8 A

9 C

10 C

11 C

12 B

13 A

14 C

15 C

16 B

17 B

18 A

19 C

20 B

21 A

22 B

23 A
Q.No Answer

24 A

25 C

26 A

27 A

28 C

29 B

30 D

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy