Graph Theory
Graph Theory
C Equations
D None of these
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
A Cyclic graph
B Regular graph
C Tree
D Not a graph
7 A graph is a collection of
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 ?
D both b and c
C Minimum weights
D All of above
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
D None of these
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
A 10, 24
B 25, 56
C -31, 11
D -64, -15
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 ?
B 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)
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
A No vertices
B Only 1 vertex
C 8 vertices
D None of these
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
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
A3
B4
C5
D6
A multigraph
B digraph
C isolated graph
D trivial graph
A Must be even
C Must be odd
A Endpoints of e
B Adjacent nodes
C Neighbors
D All of above
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
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
A Zero
B Odd
C Prime
D Even
A nn-2
B n*n
C nn
D n2
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}
C Both A and B
D None of these
A Cyclic graph
B Regular graph
C Tree
D Not 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