Type I: All topic (1 Marks) (5)

Which of the following is planner graph,

(a) K- (b) K, , (c) K, 4 (d) Ky

Which of the following 1s planner graph,

N

(a)K; (b) Ky = (c) Ky (d) Ky

Which of the following is not planner graph,

(a)K,,(b) K,, (c)K,, (d) K,,

Which of the following is not planner graph,

(a)K, (b) K, (c) K, (d) Ks

The complete graph K,, is not planer when

a) n=3 b)n=4 c) n>S5 dj)n=2
 | Which of the following ts Euler’s formula,
a) V-E+R=2 b) E-V+R=2 c) R-E+V=2 d) V-R+E=2
7. |The minimum number of colour are required to produce a proper colouring of
a simple connected graph G 1s called as
A) Weight ofG B) Chromatic number ofG
C) Vertex connectivity of G D) edge connectivity of G
8. |Acomplete graph with n vertices is
(a) 2-chromatic (b) n/2 chromatic
(c) (n — 1) chromatic (d) n-chromatic
9. |Chromatic number ofa tree with n vertices ts
(a) | (b) n+l (c) 2n (d) 2
10. | Chromatic number of a complete graph K,, is
(a) n (b) n/2 _(c) n—] (d) n+]
11. | Every bipartite graph have the chromatic number
(a) n (b) n-1 (c) 2 (d) 2
12. | Chromatic number of cycle graph C,, n > 1 and n is odd.
(a)2 (b) 3 (4 (d) 1
13. | Chromatic number of cycle graph C,, n> 1 and n is even
(a)2 (b) 3 (1S (d)_ 1
14.. | A graph which consists of only isolated vertex has chromatic number.
(a)2 (b) 1 (c) 3 (d) None of these
15. | A graph has one or more edges (without self-loop) has a minimum chromatic
number?
(a)2 (b) 3 (c)4 (d), 1
16. | Every tree with two or more vertex has chromatic number.
(a)l (b) 2 (c)4 (d) 3
17. |Ifa graph require k different colours for its proper colouring,. Then chromatic
number of the graph is,
(a) | (b) k (c) k—1 (d) k/2

ol Dhole's screen
18. A graph is a tree if and only if it is
(a) Completely connected (b)minimally connected
(c) Contains circuit (d) is planar
19. T is a graph with n vertices. T is connected and has exactly n— 1 edges then
(a) T isa tree
(b) T contains no cycle
(c) Every pair of vertices in T is connected by exactly one path
(d) Addition of new edge will create a cycle
20. A tree with n vertices has
a) n-l edges. b)nedges c)ntledges d)n-2 edges
zk, What would be the minimum number of edges in a connected graph having 11
vertices?
(a) 5 (b) 10 (Cc) 15 (d) 20
22: In an m-ary tree each internal vertices have .
A) Exactly m children’s B) minimum m children’s
C) At most m children’s—e—ee__o-_e__0—e_#
D) exactly 2m children’s
In an full m-ary tree each internal vertices have
A) Exactly m children’s or 0 children’s B) minimum m children’s
C) At most m children’s D) exactly 2m children’s
In a full m-ary tree the relation between total number of nodes n and number
of internal vertices1 is
A)n=i+1 B) n=mi -1 C)n=mt+l D)m=nitl
Which vertex is the root in the following graph?

a) {2} b) {8} c) {6} d) {4}

29. The eccentricity of vertex b in the following graph is

(a) 2 (b) 1 (c) 4 (d) 3

 29. |The eccentricity of vertex b in the following graph is

| (a) 2 (b) 1 (c) 4 (d) 3 D

30. |The eccentricity of vertex 4 in the following graph is

»| Dhole's screen
 Type Il: Planar graph

How many number of regions defined by a connected planar graph K,,

a) 2 b) 3 c)4 d)5
How many number of regions defined by a connected planar graph K,,
a)2 b)3 c)4 d)5
How many number of regions defined by a connected planar graph K,,
a)2 b)3 c)4 d)5
How many number of regions defined by a connected planar graph K,
a)2 b)3 c)4 6 @) 5
How many number of regions defined by a connected planar graph K,
a) 2 BEd)
eo) 4) oS by
A connected planar graph has six vertices, each of degree two. How many regions are there?
a) 6 b) 2 c) 3 d) 4
How many edges must a planar graph have if it has 7 regions and 5 nodes?
@ 8(b)10 (c) 12. (dd) 14
 Q
9. A connected planar graph has nine vertices, each of degree two How many regions are there?
| (a) 4 (b) 6 (c) 2 (d) 8
10. _|Aconnected planar graph has eight vertices, each of degree three. How many regions are there?
| a) 6 b) 24 c) 2 d) 4
11. |Let G be a simple connected planar graph with 13 vertices and 19 edges. Thus the number of
faces in the planner graph is
| (a) 6 (b) 8 (c) 9 (d) 13
‘12... |The maximum no. of edges in a planar graph is
| (a) 3V-—6 (b) 2V-4 __(c) 2e (d) None
‘13. {If a graph (G) is a connected planar graph with e edge and v_ vertices where
v>3 then
(a) e=3v-6 (b) e<3 v-6
(c) e=3v+6 (d) e<3v+6
14. |The minimum number of vertices necessary for a simple connected graph with 7 edges to be
planar
| a) 4 b) 5 c) 6 d) 7
15. |The maximum number of edges possible in a simple connected planar graph with 4 vertices.
a) 6 b) 5 c) 8 d)7
“*Type III: Chromatic number

* Find the chromatic number of the given graph.

1
a b
be
a

e c

i
d c d

b c
7 Vo

4 Vy Vs F e
“*Type IV: Tree & Minimal Spanning Tree
¢ Consider the given graph
What is the weight of the minimum spanning tree
using the Prim’s algorithm? 22

rc
30
3s |2

A 1D
e ee & @ @ @ @ @
A tree with 10 vertices has x vertices of degree 1 and y vertices of degree 3 then values of x
and y are
A)x=6,y =4 B) x=5,y=5 C)x=4,y=6 D)x=2,y=8
A tree with 7 vertices has x vertices of degree 1 and y vertices of degree 2 then values of x and
y are
Ajx=2Zy=5 B) x=3)\y=2 Cyxe4 y= 3 D) x=3,y=4
Which of the following is true?
a) Prim’s algorithm initializes with a vertex
b) Prim’s algorithm initializes with a edge
c) Prim’s algorithm initializes with a vertex which has smallest edge
d) Prim’s algorithm initializes with a forest
Which of the following is true?
a) Kruskal’s algorithm initializes with a vertex
b) Kruskal’s algorithm initializes with a edge
c) Kruskal’s algorithm initializes with a vertex which has smallest edge
d) Kruskal’s algorithm initializes with a forest
Which of the following graph is tree/notthee.
*“* Type V: Eccentricity

¢ The Eccentricity /diameter/radius/central points of the following graph is

“¢ Type VI: Basic Terms of a Tree
¢ Which vertices are internal vertices/leaves/children/ancestors /descendants in the following graph?

¢ What is the height of the given graph?

How many internal vertices does a full 4-ary tree with 21 vertices have?
(a) 5 (b) 4 (c) 16 (d) 21
How many vertices does a full 3-ary tree with 4 internal vertices have?
(a) 9 (5) O _Sise Og _ * S$ _2 Sides
10. |How many edge does a full binary tree with 10 internal vertices have?
(a) 9 (b) 18 (c) 20 (d) 21 e
11. |How many internal vertices does a full 4-ary tree with 21 vertices have?
(a) 5 (b) 4 (c) 16 (d) 21 A
12. |How many vertices does a full 3-ary tree with 4 internal vertices have?
(a) 9 (b) 13 (c) 5 (d) 4 B

13. |How many internal vertices does a full 3-ary tree with 13 veitices have?
(a) 9 (b) 13 (c) 5 (d) 4 D
14. |How many vertices does a full 4-ary tree with 16 leaves have?
(a) 5 (b) 4 (c) 16 (d) 21 D
15.. | How many internal vertices does a full 4-ary tree with 16 leaves have?
(a) 5 (b) 4 (c) 16 (d) 21 A
** Type VII: Prefix Codes & Optimal Binary Tree

¢ In following binary tree, the binary prefix code of the vertex 5 is