18) The minimum number of colours needed to colour a graph having n (>3) vertices and 2 edges is

19) Which of the following is useful in traversing a given graph by breadth first search

20) Which of the following is useful in implementing quick sort

21) The maximum degree of any vertex in a simple graph with n vertices is

22) The number of edges in a regular graph of degree d and n vertices is