Question Bank-5
School of Basics and Applied Science
Mathematics
Course Name: Discrete Mathematics Course Code: E1UJ204T
Unit-5
S.
Questions CO BTL
N0
1 Define graph and simple graph. 1 K1
2 Define subgraph. 1 K1
3 State Handshaking theorem. 1 K1
4 Find the union of the graphs G1 and G2 shown below:
5 How many edges are there in a graph with 10 vertices each of degree six?
6 Consider the graph G in given figure. 3 K3
(a) Describe G formally, that is, find the set V (G) of vertices of G and
the set E(G) of edges of G;
(b) Find degree of each vertex and verify Handshaking theorem;
(c) Find all simple paths from A to L;
(d) Find all trails (distinct edges) from B to C;
(d) Find all cycles
7 Consider the graph in 3 K3
S.
Questions CO BTL
N0
Find the subgraph H = H (V , E ) of G where V equals:
(a) {B,C, D, J, K}
(b) {A, C, J, L,M}
(c) {B,D, J,M}
(d) {C, K,L,M}
Which of them are isomorphic and which homoeomorphic?
8 Show that the graphs displayed below are not isomorphic. 4 K4
9 Show that the graphs G = (V , E ) and H = (W , F ) displayed in the 4 K4
following figure are isomorphic.
10 Consider the complete graph 𝐾𝑚,𝑛 . 4 K4
(a) Find the number of edges E in 𝐾𝑚,𝑛 .
(b) Find those 𝐾𝑚,𝑛 which are traversable.
(c) Which of the graphs 𝐾𝑚,𝑛 are isomorphic and which
homeomorphic?
S.
Questions CO BTL
N0
11 Consider the following multigraphs: 4 K4
(a) Which of them are connected? If a graph is not connected, find its
connected components.
(b) Which is cycle-free (without cycles)?
(c) Which is loop-free (without loops)?
(d) Which are (simple) graphs?
12 Are the graphs G and H displayed below bipartite? 3 K3
13 Describe those connected graphs which are both bipartite and regular. 3 K3
14 Draw two 3-regular graphs with: 3 K3
(a) eight vertices;
(b) nine vertices.
15 Differentiate Eulerian and Hamiltonian graphs 2 K2
16 Which graphs shown in the following figure have a Euler path? Explain 3 K3
it.
17 Consider the following graph. Which of them are traversable, that is, 3 K3
have Euler paths? Which are Eulerian, that is, have a Euler circuit? For
those that do not, explain why.
S.
Questions CO BTL
N0
18 Which of the undirected graph in the following figure have a Euler 3 K3
circuit? Of those that do not, which have a Euler Path?
19 Show that K n has a Hamilton circuit whenever 𝑛 ≥ 3. 4 K4
20 Which of the simple graphs in the following Figure have a Hamilton 3 K3
circuit or, if not, a Hamilton path?
21 Find the adjacency matrix A of each multigraph in 3 K3
22 Draw the multigraph G corresponding to each of the following 3 K3
adjacency matrices:
23 Represent the graphs shown below with an incidence matrix: 3 K3
S.
Questions CO BTL
N0
24 What do you understand by a coloring of a simple graph? 2 K2
25 Discuss the applications of Graph Colorings. 2 K2
26 Use the Welch-Powell Algorithm to paint the following graph: 3 K3
S.
Questions CO BTL
N0
27 The chromatic number of a graph is the least number of colors needed 3 K3
for a coloring of this graph. The chromatic number of a graph G is
denoted by χ (G). (Here χ is the Greek letter chi.)
What are the chromatic numbers of the graphs G and H shown in the
following Figure?
K The complete graph with 𝑛 vertices is denoted by 𝐾𝑛 . 3 K3
A complete bipartite graph is denoted by 𝐾𝑚,𝑛 , where 𝑚 is the number
of vertices in M and 𝑛 is the number of vertices in N.
The 𝑛 −cycle, denoted by 𝐶𝑛 , is the graph which consists of only a single
cycle of length 𝑛.
What is the chromatic number of 𝐾𝑛 , 𝐾𝑚,𝑛 (𝑚 and 𝑛 are positive
integers) and 𝐶𝑛 (with 𝑛 vertices, 𝑛 ≥ 3)?
29 Define trees with examples. 1 K1
30 Which of the graphs shown below are trees and not? 2 K2
31 Which of the following graphs are trees? 2 K2
(a) G = (V, E) with V = {a, b, c, d, e} and E = {{a, b}, {a, e}, {b, c}, {c,
d}, {d, e}}
S.
Questions CO BTL
N0
(b) G = (V, E) with V = {a, b, c, d, e} and E = {{a, b}, {b, c}, {c, d}, {d,
e}}
(c) G = (V, E) with V = {a, b, c, d, e} and E = {{a, b}, {a, c}, {a, d}, {a,
e}}
(d) G = (V, E) with V = {a, b, c, d, e} and E = {{a, b}, {a, c}, {d, e}}
32 Define spanning trees and minimum spanning trees. 2 K2
33 Find two different spanning trees of the following graph: 3 K3
34 Find a spanning tree for each of the following graphs: 3 K3
35 Prove that a tree with 𝑛 vertices has 𝑛 − 1 edges. 4 K4
