Scribd
Upload
36 views5 pages

Practice Question Unit-3 3

Uploaded by

avir65801
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views5 pages

Practice Question Unit-3 3

Uploaded by

avir65801
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Practice Question

Unit-3
1. How many different ways can the letters of the word CAMP be rearranged to
form a four-letter word?
2. When is a graph said to be complete?
3. What is Euler and Hamiltonian graphs.
4. If 𝑛𝑃𝑟 = 336 and 𝑛𝐶𝑟 = 56 , find 𝑛 and 𝑟.
5. Find the number of permutations of the letters of the word ALLAHABAD.
6. A group consists of 4 girls and 7 boys. In how many can a team of 5 members
selected if the team has NO GIRLS.
7. Define permutation and Combination.
8. Define order of the graph.
9. Prove that 𝑛𝐶𝑟 + 𝑛𝐶𝑟−1 = 𝑛 + 1𝐶𝑟 .
10.Find the Degree of the Vertices

11. Draw Simple graphs of ONE, TWO and THREE vertices.


12.Find “n” if a complete graph having n vertices has 15 edges.
13.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?
14.Show that a simple graph of order 4 and size 7 does not exist.
15.Show that minimum number of edges in a simple graph with n vertices is
𝑛(𝑛−1)
.
2
(𝒏−𝟏)
16.If G is a graph with n with points and 𝜹(𝑮) ≥ then G is connected.
𝟐
17.Give an example to show that two graph of same order and same size need not
be isomorphic.
18.Every non-trivial tree has atleast 2 vertices of degree 1.
19.A graph is a tree if and only if G has no cycled and |E| = |v| - 1.
20.T is binary tree on n vertices. Show that the number of pendant vertices in T
(𝑛+1)
is .
2
21.For each of the following degree sequences, find if there exists a graph. In
each case, either draw a graph or explain why no graphs exists. (a) 4, 4, 4, 3,
2 (b) 5, 5, 4, 3, 2, 1 (c) 3, 3, 3, 3, 2 (d) 3, 3, 3, 3, 3, 3 (e) 5, 4, 3, 2, 1, 1
22.Explain Konisberg bridge problem. Represent the problem by means of graph.
Does the problem have a solution?
23.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.
24.Use Dijkstra’s algorithm to find the shortest path between the vertices A and
H in the weighted graph.

Fig.1
25.By using circuits, prove that the two graphs G1 and G2 given in Fig are
isomorphic. Verify the same by using adjacency matrices.

Fig. 2
26.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 F in each of the
subgraph.
Fig. 3
27.Show that the sum of degree of vertices in a undirected graph is equal to twice
the sum of number of edges.
28.Show that an undirected graph has an even number of odd degree vertices.
29.Show that the sum of squares of the in-degree over all vertices is equal to the
sum of the square of the out-degree over all vertices in a directed complete
graph.
30.Show that a graph is bipartite if and only if it is possible to assign one of two
different colors to each vertex of the graph so that no two adjacent vertices are
assigned the same color.
31.Show that there is a simple path between every two pair of vertices of a
connected undirected graph.
32.A connected multi graph has an Euler circuit if and only of the degree of each
vertices are even.
33.A connected multi graph has an Euler path but not an Euler circuit if and only
if it has exactly two vertices of odd degree.
34.Whether the graph given below is Euler circuit or not?
35.Let G is a connected planar simple graph with e edges, and v vertices where v
 3. Then show that e  3v- 6.
36.Let G is a connected planar simple graph, then show that G has vertex of
degree not exceeding five.
37.Show that there is no complete planar graph with more than 4 vertices.
38.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.
39.Let G is a connected planar simple graph with e edges, and v vertices. Let r be
the number of regions in a planar representation of G. Then show that r=e-
v+2.
40.Find the chromatic number of the graph Cn.
41.Find the chromatic number of the graph Kn.
42.Find the chromatic number of the graph Km,n.
43.Show that an undirected graph is a tree if and only if there is a unique simple
path between any two vertices.
44.Show that a tree with n vertices has n-1 edges.
45.Show that an m-ary tree with I internal vertices contains n=mi+1 vertices.
46.Use Prim’s algorithm to find the minimum spanning tree in the graph given.
47.Use Kruskal’s algorithm to find the minimum spanning tree in the graph given.

You might also like