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 vertex 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 }

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 A graph is a collection of

A Row and columns

B Vertices and edges

C Equations

D None of these

8 How many relations are there on a set with n elements that are symmetric and a set with n elements
that are reflexive and symmetric ?

A 2n(n+1)/2 and 2n.3n(n–1)/2

B 3n(n–1)/2 and 2n(n–1)

C 2n(n+1)/2 and 3n(n–1)/2

D 2n(n+1)/2 and 2n(n–1)/2

9 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

10 A minimal spanning tree of a graph G is

A A spanning sub graph

C Minimum weights

D All of above

11 A partial ordered relation is transitive, reflexive and

A Antisymmetric

B Bisymmetric

C Anti reflexive

D Asymmetric

12 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 n2/2

13 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

14 The expression a+a c is equivalent to

Aa

B a+c

Cc

D1

15 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

16 A continuous non intersecting curve in the plane whose origin and terminus coincide

A Planer

B Jordan

C Hamiltonian

D All of these

17 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

18 Which of the following pair is not congruent modulo 7?

A 10, 24

B 25, 56

C -31, 11

D -64, -15

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

A n–1

B n+1

C 2n–1

Dn
20 Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the
graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from
s to v has weight 65. Which statement is always true ?

A Weight (u, v) <= 12

B Weight (u, v) = 12

C Weight (u, v) >= 12

D Weight (u, v) > 12

21 How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?

A 2n

B 2n – 1

C 2n – 2

D 2(2n – 2)

22 Hasse diagram are drawn

A Partially ordered sets

B Lattices

C Boolean algebra

D None of these

23 In how many ways can 5 balls be chosen so that 2 are red and 3 are black

A 910

B 990

C 970

D None of these

24 Circle has ____________

A No vertices
B Only 1 vertex

C 8 vertices

D None of these

25 If B is a Boolean Algebra, then which of the following is true

A B is a finite but not complemented lattice

B B is a finite, complemented and distributive lattice

C B is a finite, distributive but not complemented lattice

D B is not distributive lattice

26 If R is a relation “Less Than” from A = {1,2,3,4} to B = {1,3,5} then RoR-1 is

A {(3,3), (3,4), (3,5)}

B {(3,1), (5,1), (3,2), (5,2), (5,3), (5,4)}

C {(3,3), (3,5), (5,3), (5,5)}

D {(1,3), (1,5), (2,3), (2,5), (3,5), (4,5)}

27 Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph,
then the number of bounded faces in any embedding of G on the plane is equal to

A3

B4

C5

D6

28 A graph is tree if and only if

A Is planar

B Contains a circuit

C Is minimally

D Is completely connected
29 Suppose v is an isolated vertex in a graph, then the degree of v is

A0

B1

C2

D3

30 The complete graph with four vertices has k edges where k is

A3

B4

C5

D6

31 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

32 A graph with one vertex and no edges is

A multigraph

B digraph

C isolated graph

D trivial graph

33 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

A Endpoints of e

B Adjacent nodes

C Neighbors

D All of above

35 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

36 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

37 The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is

A Reflexive

B Transitive

C Symmetric

D None of these

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

A Zero

B Odd

C Prime
D Even

39 The complete graph K, has… different spanning trees?

A nn-2

B n*n

C nn

D n2

40 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

41 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

42 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

43 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

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

A2

B3

C4

D5

45 The number of colours required to properly color vertices of every planar graph is

A2

B3

C4

D5