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

Answer = B
a. Row and columns Explanation: A walk is defined as finite altering
b. Vertices and edges sequence of vertices and edges. No Edges
c. Equations appear more than once but vertex may appear
d. None of these more than once.
Answer = B
6) If the origin and terminus of a walk are
2) The degree of any vertex of graph is .... ? same, the walk is known as... ?
a. The number of edges incident with vertex a. Open
b. Number of vertex in a graph b. Closed
c. Number of vertices adjacent to that vertex c. Path
d. Number of edges in a graph d. None of these

Answer = A Answer = B
Explanation: The number of edges connected Explanation: A walk which begins and ends
on a vertex v with the self loop counted twice is with same vertex is called closed walk
called the degree of vertex. otherwise it is open.

3) If for some positive integer k, degree of 7) A graph G is called a ..... if it is a connected

vertex d(v)=k for every vertex v of the graph G, acyclic graph ?
then G is called... ? a. Cyclic graph
a. K graph b. Regular graph
b. K-regular graph c. Tree
c. Empty graph d. Not a graph
d. All of above
Answer = B Answer = C
Explanation: A graph in which all vertices are of Explanation: No explanation for this question.
equal degree is called regular graph.
8) Eccentricity of a vertex denoted by e(v) is
4) A graph with no edges is known as empty defined by.... ?
graph. Empty graph is also known as... ? a. max { d(u,v): u belongs to v, u does not
a. Trivial graph equal to v : where d(u,v) is the distance
b. Regular graph between u&v}
c. Bipartite graph b. min { d(u,v): u belongs to v, u does not
d. None of these equal to v }
c. Both A and B
Answer = A d. None of these
Explanation: Trivial graph is the second name
for empty graph. Answer = A
Explanation: The eccentricity E(v) of a vertex V
5) Length of the walk of a graph is .... ?
in the graph is the distance from v to the vertex
a. The number of vertices in walk W
farthest from v in G.
b. The number of edges in walk W
c. Total number of edges in a graph 9) Radius of a graph, denoted by rad(G) is
d. Total number of vertices in a graph defined by.... ?
a. max {e(v): v belongs to V }
b. min { e(v): v belongs to V} 13) Choose the most appropriate definition of
c. max { d(u,v): u belongs to v, u does not plane graph ?
equal to v } a. A graph drawn in a plane in such a way that
d. min { d(u,v): u belongs to v, u does not any pair of edges meet only at their end vertices
equal to v } b. A graph drawn in a plane in such a way that
if the vertex set of graph can be partitioned into
Answer = A two non - empty disjoint subset X and Y in such
Explanation: The diameter or radius of a graph a way that each edge of G has one end in X and
G is largest distance between two vertices in one end in Y.
the graph G. c. A simple graph which is Isomorphic to
Hamiltonian graph
10) The complete graph K, has... different
d. None of these
spanning trees?
a. n^n-2
Answer = A
b. n*n
Explanation: No explanation for this question.
c. n^n
d. n^2
14) A continuous non - intersecting curve in
^ = raised to for exponent
the plane whose origin and terminus coincide ?
Answer = A
a. Planer
b. Jordan
11) A tour of G is a closed walk of graph G
c. Hamiltonian
which includes every edge G at least once. A
d. All of these
..... tour of G is a tour which includes every
edge of G exactly once ?
Answer = B
a. Hamiltonian
Explanation: The jordan graph is the set of all
b. Planar
vertices of minimum eccentricity that is the set
c. Isomorphic
of all vertices A where the greatest distance to
d. Euler
other vertex B is minimal.

Answer = D
15) Polyhedral is.... ?
Explanation: If some closed walk in a graph
a. A simple connected graph
contains all the edges then the walk is called
b. A plane graph
Euler.
c. A graph in which the degree of every vertex
and every face is atleast 3
12) Which of the following is not a type of
d. All of above
graph ?
a. Euler
Answer = D
b. Hamiltonian
Explanation: A polyhedral graph is the
c. Tree
undirected graph formed from the vertices and
d. Path
edges of a convex polyhedron

Answer = D
16) A path in graph G, which contains every
Explanation:Path is a way from one node no
vertex of G once and only once ?
another but not a graph.
a. Eulartour
b. Hamiltonian Path depending upon ?
c. Eular trail a. Total number of edges in a graph is even or
d. Hamiltonian tour odd
b. Total number of vertices in a graph is even
Answer = B or odd
Explanation:A Hamiltonian circuit in a c. Its degree is even or odd
connected graph is defined as a closed walk d. None of these
that traverse every vertex of G exactly once
except the starting vertex. Answer = C
Explanation: The vertex of a graph is called even
17) A minimal spanning tree of a graph G is.... ?
or odd based on its degree.
a. A spanning sub graph
b. A tree
21) Let A and B be any two arbitrary events
c. Minimum weights
then which one of the following is true ?
d. All of above
a. P( A intersection B) = P(A). P(B)
b. P(A union B) = P(A) + P(B)
Answer = D
c. P(AB) = P(A intersection B). P(B)
Explanation: A tree is said to be spanning tree
d. P(A union B) >= P(A) + P(B)
of connected graph G if it is subgraph of G and
contains all the vertices of G.
Answer = D

18) A tree having a main node, which has no

predecessor is.... ? 22) If X and Y be the sets. Then the set ( X - Y)
a. Spanning tree union (Y- X) union (X intersection Y ) is equal
b. Rooted tree to?
c. Weighted tree a. X union Y
d. None of these b. Xc union Yc
c. X intersection Y
Answer = B d. Xc intersection Yc
Explanation:A tree in which one vertex
distinguish from all other is called rooted tree. Answer = A

19) Diameter of a graph is denoted by diam(G)

is defined by.... ? 23) If G is an undirected planer graph on n
a. max (e(v) : v belongs to V) vertices with e edges then ?
b. max( d(u,v) ) a. e<=n
c. Both A and B b. e<=2n
d. None of these c. e<=3n
d. None of these
Answer = C
Explanation: The diameter of a graph G is Answer = B
largest distance between two vertices in a
24) Which of the following statement is false ?
graph G.
a. G is connected and is circuitless
b. G is connected and has n edges
20) A vertex of a graph is called even or odd
c. G is minimally connected graph
d. G is circuitless and has n-1 edges

Answer = B

25) Probability that two randomly selected

cards from a set of two red and two black
cards are of same color is ?
a. 1 / 2
b. 1 / 3
c. 2 / 3
d. None of these

Answer = B

26) The number of circuits that can be created

by adding an edge between any two vertices in
a tree is ?
a. Two
b. Exactly one
c. At least two
d. None

Answer = B

27) In a tree between every pair of vertices

there is ?
a. Exactly one path
b. A self loop
c. Two circuits
d. n number of paths

Answer = A