CLASS- FYBSC

GRAPH THEORY MCQ FOR PRACTICE

1. A graph is a collection of.... ?

a. Row and columns b. Vertices and edges

c. Equations d. None of these

2. The degree of any vertex of graph is .... ?

a. The number of edges incident with vertex b. Number of vertices in a graph

c. Number of vertices adjacent to that vertex d. Number of edges in a graph

3. A graph with no edges is known as empty graph. Empty graph is also known as...

a. Trivial graph b. Regular graph c. Bipartite graph d. None of these

4. If the origin and terminus of a walk are same, the walk is known as... ?

a. Open b. Closed c. Path d. None of these

5. Radius of a graph, denoted by rad(G) is defined by.... ?

a. max {e(v): v belongs to V } b. min { e(v): v belongs to V}

c. max { d(u,v): u belongs to v, u does not equal to v } d. min { d(u,v): u belongs to v, u does not equal to v }

6. A graph G is called a ..... if it is a connected acyclic graph

a. Cyclic graph b. Regular graph c. Tree d. Not a graph

7. In a graph if e=(u, v) means

a. u is adjacent to v but v is not adjacent to u b. e begins at u and ends at v

c. u is processor and v is successor d. both b and c

8. A minimal spanning tree of a graph G is

a. A spanning sub graph b. A tree c. Minimum weights d. All of above

9. A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

a. greater than n–1 b. less than n(n–1) c. greater than n(n–1)/2 d. less than 𝑛2 /2

10. A vertex of a graph is called even or odd depending upon

a. Total number of edges in a graph is even or odd b. Total number of vertices in a graph is even or odd

c Its degree is even or odd d. None of these

11. A graph with no edges is known as empty graph. Empty graph is also known as

a. Trivial graph b. Regular graph c. Bipartite graph d. None of these

12. A graph with n vertices will definitely have a parallel edge or self-loop of the total number of edges are

a. more than n b. more than n+1 c. more than (n+1)/2 d. more than n(n-1)/2

13. The maximum degree of any vertex in a simple graph with n vertices is

a. n–1 b. n+1 c. 2n–1 d. n

14. A graph is tree if and only if

a. Is planar b. Contains a circuit c. Is minimally d. Is completely connected

15. Suppose v is an isolated vertex in a graph, then the degree of v is

a. 0 b. 1 c.2 d.3

16. The complete graph with four vertices has k edges where k is

a. 3 b. 4 c. 5 d. 6

17. Length of the walk of a graph is

a. The number of vertices in walk W b. The number of edges in walk W

c. Total number of edges in a graph d. Total number of vertices in a graph

18. A graph with one vertex and no edges is

a. multigraph b. digraph c. isolated graph d. trivial graph

19. In any undirected graph the sum of degrees of all the nodes

a. Must be even b. Are twice the number of edges c. Must be odd d. Need not be even

20. In a graph if e=[u, v], Then u and v are called

a. Endpoints of e b. Adjacent nodes c. Neighbors d. All of above

21. The number of leaf nodes in a complete binary tree of depth d is

a. 2d b. 2d–1+1 c. 2d+1+1 d. 2d+1

22. An undirected graph possesses an Eulerian circuit if and only if it is connected and its vertices are

a. all of even degree b. all of odd degree c. of any degree d. even in number

23. In an undirected graph the number of nodes with odd degree must be

a. Zero b. Odd c. Prime d. Even

24. The complete graph K, has... different spanning trees?

a. 𝒏𝟐 − 𝟐 b. 𝑛2 c. n d. none of these

25. Eccentricity of a vertex denoted by e(v) is defined by.... ?

a. max { d(u,v): u belongs to v, u does not equal to v : where d(u,v) is the distance between u & v}

b. min { d(u,v): u belongs to v, u does not equal to v }

c. Both A and B

d. None of these

26. If for some positive integer k, degree of vertex d(v)=k for every vertex v of the graph G, then G is called... ?

a. K graph b. K-regular graph c. Empty graph d. All of above

27. The number of colours required to properly colour the vertices of every planer graph is

a. 2 b. 3 c. 4 d. 5

28. Select which one is incorrect?

a. The number of edges appearing in the sequence of a path is called the
length of the path.
b. Every simple path of a digraph is also an elementary path
c. A path which originates and ends with the same node is called a
cycle.
d. Every elementary path of a digraph is also a simple path.

29. The degree of any vertex of the graph is known as?

a. Number of edges in a graph b. Number of a vertex in a graph
c. Number of vertices adjacent to that vertex d. The number of edges incident with the vertex

30. The Empty graph is also known as?

a. Bipartite graph b. Regular graph c. Trivial graph d. both a and b

31. When the origin and terminus of a walk both are the same, the walk is
called?
a. Open b. Path c. Closed d.way

32. Select the minimal spanning tree of a graph G

a. A tree b. A spanning subgraph c. Minimum weights d. All of the above
33. A graph with n vertices will must have a parallel edge the total number
of edges are________?
a. greater than n(n–1)/2 b. less than n(n–1) c. greater than n–1 d. none of these

34. the maximum degree of any vertex in a simple graph with n vertices
is
a. 2n–1 b. n+1 c. n–1 d. n

35. 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

36. In the given graph identify the cut vertices.

a. B and E b. C and D c. A and E d. C and B

37. For the given graph(G), which of the following statements is true?

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

38. 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

39. The given Graph is regular.

a. True b. False

40. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
a) True
b) False

41. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
a.15 b. 3 c. 1 d. 11

42. 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)/2

43. Which of the following properties does a simple graph not hold?
a. Must be connected b. Must be unweighted
c. Must have no loops or multiple edges d. Must have no multiple edges

44. What is the maximum number of edges in a bipartite graph having 10 vertices?
a. 24 b. 21 c. 25 d. 16
45. 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

46. 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

47. 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,5

48. A graph with all vertices having equal degree is known as a __________
a. Multi Graph b. Regular Graph
c. Simple Graph d. Complete Graph

49. 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

50. On which of the following statements does the time complexity of checking if an edge exists between two
particular vertices is not, depends?
a. Depends on the number of edges
b. Depends on the number of vertices
c. Is independent of both the number of edges and vertices
d. It depends on both the number of edges and vertices

51. In the given connected graph G, what is the value of rad(G) and diam(G)?
a. 2, 3 b. 3, 2 c. 2, 2 d. 3, 3

52. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will
be the number of connected components?
a. 1 b. 2 c. 3 d. 4

53. Number of vertices with odd degrees in a graph having a eulerian walk is ________
a) 0 b) Can’t be predicted c) 2 d) either 0 or 2

54. How many of the following statements are correct?

i) All cyclic graphs are complete graphs.
ii) All complete graphs are cyclic graphs.
iii) All paths are bipartite.
iv) All cyclic graphs are bipartite.
v) There are cyclic graphs which are complete.

a. 1 b. 2 c. 3 d. 4

55. All paths and cyclic graphs are bipartite graphs.

a. True
b. False

56. What is the number of vertices of degree 2 in a path graph having n vertices, here n>2.
a. n-2 b. n c. 2 d. 0

57. All trees with n vertices consists of n-1 edges.

a. True
b. False
58. Which of the following graphs are isomorphic to each other?

a. fig 1 and fig 2 b. fig 2 and fig 3

c. fig 1 and fig 3 d. fig 1, fig 2 and fig 3

59. In the given graph which edge should be removed to make it a Bipartite Graph?

a. A-C b. B-E c. C-D d. D-E

60. What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or
not given its adjacency matrix?
a. O(E*E) b. O(V*V) c. O(E) d. O(V)

61. Dijkstra’s Algorithm will work for both negative and positive weights?
a. True
b. False

62. A graph having an edge from each vertex to every other vertex is called a ___________
a. Tightly Connected b. Strongly Connected
c. Weakly Connected d. Loosely Connected

63. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
a. 2 b. 4 c. 5 d. 9

64. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________
a. O(V*V) b. O(V*V*V) c. O(E*V) d. O(E*E)

65. All Graphs have unique representation on paper.

a. True
b. False
66. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a
directed weighted graph from 2 vertices u and v will never change?
a. add all values by 10 b. subtract 10 from all the values
c. multiply all values by 10 d. in both the cases of multiplying and adding by 10

67. What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?
a. 28 b. 64 c. 256 d. 56

68. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no
cycles in the graph?
a. 21 b. 7 c. 6 d. 49

69. All undirected Multigraphs contain eulerian cycles.

a True b False

70. Determine the number of vertices for the given Graph or Multigraph?
G is a 4-regular Graph having 12 edges.
a. 3 b. 6
c. 4 d. Information given is insufficient

71. Which of the following statement is true.

a. There exists a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum
degree is 9
b. There exists a MultiGraph having 10 vertices such that minimum degree of the graph is 0 and
maximum degree is 9
c. There exists a MultiGraph as well as a Simple Graph having 10 vertices such that minimum degree of the
graph is 0 and maximum degree is 9
d. None of the mentioned

72. Which of the following is true about Handshaking Lemma?

a. In Handshaking lemma, if the degree of a vertex is even, the vertex is called an even vertex
b. The degree of a graph is the largest vertex degree of that graph.
c. The degree of a vertex is odd, the vertex is called an odd vertex.
d. The sum of all the degrees of all the vertices is equal to twice the number of edges.

73. If in a graph multiple edges between the same set of vertices are allowed, it is called?
a. Hamiltonian Graphs b. Simple graph
c. Multi graph d. Euler Graphs

74. The graph in which, there is a closed trail which includes every edge of the graph is known as?
a. Hamiltonian Graphs b. Euler Graphs
c. Planar graph d. Directed Graph

75. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be

a. 180 b. 720
c. 360 d. 540