1.

Let G
he A
the
(a)
nninimum
edgns,
9
non-planar numbeT
Then GCpossible
has
edpes and 5
gTAph with
of
Chapter Practice
(b) A
gaph
way that drawn in a
vertexplarne
(b) P if the in
(c) 10edoes and 6 vertices be set of such a 17. A vertex of
edoes and 5vertices partitioned
disjoint into WO araph can
non-empty a tree is degree graater than
way thatsubsets
1in
and 6 Vertices
)
(a) branchcalled
10 edoes X and Y in a
each Such vertex
9 In a vertices X and
one end edge of
Ghas one end (b) terminal verto
node binary
in Y
tree with (c) A
to simple
n (C) anCestor
numbernodes,
has an odd eve graphgraph
Hamiltonian which is
descendants. Every node is of (d) None of the isomorphic (d) None of
18. In the the above
considered
What
to be its own 10. Which of the above
following graph
is the
tree that have descendent.
number of nodes in the false? following statement. is e1
e2
e3

(a) 0 exactly one child? (a) G is

(b) G is connected and
(b) 1
(d) n-1 (c) G is connected and circuitless
nomally has n edges
(d) G is connected How many simple
Jength of the walk of the graph is 11. The circuitless and has n-1graph
edges from V, to V paths are there
a) the number of
vertices walk W
b) the number of edges
in Hamiltonian
following graph iscircuit for the
(a) 2
19. Any two
o) 3 (c) 4 (d) 5
(c) total number of
edges
in walk W
spanning trees for a graph
(a) does not
edges contain same nunber of
in a graph
i)total number of
vertices in a araph (b) have the
AIf the origin and
terminusof a walk same degree of
one samne, the walk
(a) Open
is known as
b) Closed
Corresponding edges
(e) contain
(d) may or same number of edges
(a) abcdefgh may not
(c) Path (d) None of these (c) abcdefgha (b) abefgha number of edgescontain same
5. A minimal spanning tree of a
(d) None of 20. Aline
12. Suppose that a these
graph verticessegment
is calledjoining pair of
G is
la) a spanningsub-graph
simple graph hasconnected
30 edges.planar
If a (a) loop
plane drawing of this (c) node b) edge
(b) a tree
faces, how many graph has 20 21.Which of the
(d) None of these
minimum weights Bs- 8raph has 2 vertices does the
(d) Allof the above -fa) 12 (b) 13
(c) 14 (d) 15
tree? following graphs are
A Atree having a main node which 13. If Gis a(p,
g)-graph and x is a vertex
VA
has no predecessor is in G, then the
(a) Spanning tree {b) Rooted tree (a) p+1-de(x) degree of x in G is
(c) p+ 1+ d(x) (b) p-1-d,()
(ay
(c) Weighted tree (d) None of (b)
these (d) p-1+ da(x)
1Atour of G is closed walk of
graph G 14. If a graph is a tree then,
which includes every edge G atleast (a) it has 2
once. Atour of G which includes spanning
b) it has only 1
trees
every edge of Gexactly once,is a (c) it has 4 spanning tree ()

a) Hamiltonian tour (d) it has 5 spanning trees

spanning trees
b) Planar tour 15. Euler formula for
c) Isomorphic tour (a) f =e -v graphs is
(d) Euler tour (b) f=e + V+2 (e)
(c) f =e - v -e (d) f =e -v+2
Which of the following is not a type 16. The given graph is (a) a, b, c (b) b, c, d
d' graph? (c) c, d, e (d) a, c, e
a) Euler (b) Hamiltonian 22. Asubgraph of a graph G
oTree that
ta) Path contains every vertex of G and is a
Chose the most tree is called
deinition of planeappropriate
graph.
(a) trivial tree
c) spanning tree
(o) empty tree
(d) None of these
AAgraph drawn in a V4 V5
plane in Such a 23. In the planar graph, the graph
Way that any pair of edges
at heir end meet only (a) simple graph (b) complete graph crossing number is
vertices (c) bipartite graph (d) None of these (b) 1 (c) 2 (d) 3
 Discrete Mathematics
320
Q, is not
(a) k, is planar while
24. If a graph has any vertex of degree 30. The number of circuits that can be 6) Both k, and Q, are
planars
3, then created by adding an edge between planar while k, is not
(a) it must have Euler circuit any two vertices in a tree is er Q, is planar
(b) it must have Hamiltonian circuit
d) Neither k, and Q, is
(a) Two b) Exactly one n
lc) it does not have Euler circuit (c) At least two (d) None of these 36. Let G be an arbitrary graph with
(d) it does not have Hamiltonian circuit nodes and k components. If a vertex
31. The degree of any vertex of graph is number of
25. A connected graph G is Eulerian iff (aB the number of edges incident with
is removed from G, the
components in the resultant graph
the degree of each of its vertices is vertex necessarily lie between
must
(a) odd (b) numnber of vertex in a graph (b) k- 1 and k + 1
(c) number of vertices adjacent to that (a) k and n
by even (c) k - 1and n 1 (d) k + 1and n -k
(c) prime vertex
(d) None of the above (d) number of edges in a graph 37. Which one of the following is
true
26. The degrees of {a, b, c, d, e} in the 32. If for some positive integer k, degree for any simple connected undirected
of vertex d(V)=k for every vertex V graph with more than 2 vertices?
given graph is (a) No two vertices have the same
a
of the graph G, then G is called
(a) k graph 6) k-regular graph degree
(o) Atleast twO vertices have the same
(c) empty graph (d) All of the above
degree
33. A graph with no edges is known as (c) Atleast three vertices have the same
empty graph. Empty graph is also degree
known as (d) Allvertices have the same degree
ta) trivial graph (b) regular graph 38. Which of the following graphs is not
(a) 2, 2, 3, 1, 1 (b) 2, 3, 1,0, 1 (c) bipartite graph (d) None of these
(c) 0, 1, 2, 2, 0 (d) 2, 3, 1, 2, 0 planar ?
34. A vertex of a graph is called ever or
27. The graph given below odd depending upon
(a) total number of edges in a graph is
even or odd Jay G1:
(b) total number of vertices in a graph is
ever or odd
fc) its degree is even or odd
(b) None of the above
(b) G:
la) has Euler circuit 35. k, and Q, are graphs with the
(b) has Hamiltonian circuit
following structure
(c) does not have Hamiltonian
circuit
(d) None of the above
(c) G3
28. Complete graph is planar if
(a) n= 4 (b) n >4
(e) ns 4 (d) None of these
29. If G is an undirected planar graph of Q3
n vertices with e edges then
Which one of the following (d) G4:
(a)e sn (b) e s2n
(c)e s 3n (d) None of these statements is true in relation to
these graphs?

Answers
(b) 5 (d) 6 (b) 7 (d) 8 (d) 9 (a) 10. (
1. (b) 2. (a) 3 (b) 4.

11. (c) 12. (a) 13. (6) 14. (b) 15. (d) 16. (a) 17. (a) 18. (b) 19. (c) 20.

24. 25. (b) 26. (d) 27. (c) 28. (c) 29. (b) 30.
1. (a) 22. (c) 23. (a)

1 (a) 32. (b) 33. (a) 34. (c) 35. (b) 36. (c) 37. (b) 38. (a)