Practice Questions

Unit-3
1. Give an example of a graph with nine vertices and no cut points?
2. What is Euler and Hamiltonian graphs.
3. Define order of the graph.
4. Find the degree of all the vertices of the given graph

5. What do you mean by Simple graphs? Draw Simple graphs of ONE, TWO
and THREE vertices.
6. Find “n” if a complete graph having n vertices has 15 edges.
7. Suppose G is a non-directed graph with 12 edges. If G has 6 vertices each of
degree 3 and the rest have degree less than 3, What is the minimum number
of vertices G can have?
8. Find the maximum number of edges in an n-node undirected graph without
self-loops.
9. A graph is a tree if and only if G has no cycled and |E| = |v| - 1.
10.Explain Konisberg bridge problem. Represent the problem by means of graph.
Does the problem have a solution?
11.Give an example of a graph which contains (i) an Eulerian circuit that is also
a Hamiltonian circuit (ii) an Eulerian circuit and a Hamiltonian circuit that are
distinct (iii) an Eulerian circuit, but not a Hamiltonian circuit (iv) a
Hamiltonian circuit, but not an Eulerian circuit (v) neither an Eulerian circuit
nor a Hamiltonian circuit.
12.Use Dijkstra’s algorithm to find the shortest path between the vertices A and
H in the weighted graph.
 Fig.1
13.By using circuits, prove that the two graphs G1 and G2 given in Fig. 2 are
isomorphic.

Fig. 2
14.Find all the connected subgraphs obtained from the graph given in Fig 3. by
deleting each vertex. List out the simple paths from A to D in each of the
subgraph.

Fig. 3
15.Show that the sum of degree of vertices in a undirected graph is equal to twice
the sum of number of edges.
16.Show that there is a simple path between every two pair of vertices of a
connected undirected graph.
17.Prove that the finite connected graph is Eulerian if and only if each vertex
has even degree.
18.Let G is a connected planar simple graph with e edges, and v vertices. Then
show that e ≤ 3v- 6.
19.Check whether D6 is a sub-lattice of D20 under the divisibility relation.
20.Draw the Hasse diagram of D105 and D72. Is D72 homomorphic to D105
21.Find least upper bound and greatest lower bound of 3 and 7 in D105, if they
exist.
22.Prove that the following lattices are non-distributive.

23.Let < L, *, + > be a lattice where L = {0,1}. The operations * and + are
logical operators AND and OR respectively. Find < L3, *, +> .
24.Give the Hasse diagrams of all non-isomorphic lattices that have one, two,
three, four, or five elements.
25.Check whether the given lattice is
a) bounded
b) distributive
c) complemented

26.Determine the length of the path from V1 to V8.

27.A graph G has 15 edges, 2 vertices of degree 4 and other vertices are of
degree 2. Find the number of vertices in G.
28.There are 25 telephones in City A. Is it possible to connect them with wires so
that each telephone is connected with exactly 7 others?
29.What is maximum number of leaves in binary tree of height 5? If binary tree
has 100 leaves, what is a lower bound on its height?
30.Find all spanning trees of the graph below. How many different spanning
trees are there? How many different spanning trees are there up to
isomorphism (that is, if you grouped all the spanning trees by which are
isomorphic), How many groups would you have?

31.Let G is a connected planar simple graph, then show that G has vertex of
degree not exceeding five.
32.Show that there is no complete planar graph with more than 4 vertices.
33.An undirected graph has 15 edges; 1 vertex has degree 4; 6 vertices have
degree 3 and each of the remaining k vertices has degree 2. Find the value of
k.
34.Define Euler’s formula?
35.State Handshaking Lemma?
36.Find the chromatic number of the graph K4.
37.Find the chromatic number of the graph K3,4.
38.Use Prim’s algorithm to find the minimum spanning tree in the graph given.
39.Use Kruskal’s algorithm to find the minimum spanning tree of the given graph.
40.Draw the following graphs: (i) K5 , (ii) K4,6 , (iii) K3,4 , (iv) C5
41.How many edges are there in a graph with 6 vertices each of degree 4?
42.Give two differences between Euler circuit and Hamiltonian circuit?
43.How many regions are there in a connected planner graph with 3 nodes and 4
edges?
44.Let G be a connected planar graph with 8 vertices. If the no. of edges on each
face is 4, then what is the no. of edges in G?
45.Prove that K5 is non-planar graph?
46.Define Chromatic numbers and give example?

47.

48.
 49.

55. Consider the undirected graph G where V(G) = {P, Q, R, S, T} and E(G) = {(P,
Q), (P, R), (Q, R), (Q, S), (Q, T), (R, S), (R, T), (T, S)}
 a) Express this graph G by adjacency table.

b) Does G has any parallel edges?

c) Find all simple paths from P to T?

d) Write all cycles in G?

e) Find in-degree of T and out-degree of Q?

56. Define General tree and binary tree? Give examples.

57. Write preorder, postorder and inorder of the following binary tree:

58. Find preorder, postorder and inorder of the following binary tree:
59. Use Kruskal’s algorithm to find the minimum spanning tree of the given graph.

60. Use Kruskal’s algorithm to find the minimum spanning tree of the given graph.