Department of Mathematics

Question Bank
Applied Discrete Mathematical Structures and Graph Theory (22MAT41A)
Unit - I

1. Define proposition along with examples.

2. Define the following propositions and also construct the truth tables.

(a) Conjunction
(b) Disjunction
(c) Exclusive disjunction
(d) Conditional
(e) Biconditional
(f) Negation

3. Define Converse, Contrapositive and Inverse of the conditional proposition.

4. Write the converse, contrapositive and inverse of the following statements:

(a) The home team wins whenever it is raining.

(b) If Bolt is concerned about his cholesterol levels, then he will walk at least two miles
three times a week.

5. Write the negation of the following statements.

(a) Vandana’s smartphone has at least 32GB of memory.

(b) There is no pollution in Bangalore.

6. Express each of the following propositions as an English sentence:

(a) Given p: I bought a lottery ticket this week, q: I won the million dollar jackpot.
¬p, p ∨ q, p → q, p ↔ q, p ∧ q, ¬p(p ∧ q).
(b) Given p :The election is decided, q : The votes have been counted.
¬p ∧ q, ¬p → ¬q, ¬q ∨ (¬p ∧ q).

7. Translate the given statement into propositional logic:

(a) You can access the Internet from campus only if you are a computer science major
or you are not a freshman.
(b) You cannot ride the roller coaster if you are under 4 feet tall unless you are older
than 16 years old.

8. Given p : You drive over 65 miles per hour. q :You get a speeding ticket. Translate the
following into propositional logic:

(a) You do not drive over 65 miles per hour.

(b) You drive over 65 miles per hour, but you do not get a speeding ticket.
(c) You will get a speeding ticket if you drive over 65 miles per hour.

1
 (d) If you do not drive over 65 miles per hour, then you will not get a speeding ticket.
(e) Driving over 65 miles per hour is sufficient for getting a speeding ticket.
(f) You get a speeding ticket, but you do not drive over 65 miles per hour.

9. Write the truth values of the following propositions:

(a) If 3 + 4 = 12, then 3 + 2 = 6.

(b) If Obama is the president of the United States, then 2 + 3 = 5.
(c) 2 + 2 = 4 or Monkey will fly in the sky.
(d) 2 + 2 = 4 and Monkey will fly in the sky.
(e) 0 > 1 if and only if 2 > 1.

10. For each of these sentences, determine whether an inclusive or, or an exclusive or, is
intended. Explain your answer.

(a) A password must have at least three digits or be at least eight characters long.
(b) Experience with C++ or Java is required.
(c) Breakfast includes Coffee or Tea.
(d) Publish or perish.
(e) You can pay using U.S. dollars or euros.

11. Construct the Truth tables for the following compound propositions.

(a) p ∧ ¬p
(b) p ∨ ¬p
(c) (p ∨ ¬q) → (p ∧ q)
(d) (p → q) ∨ (¬p → q)
(e) (p → q) ∧ (¬p → r)

12. Define Tautology, Contradiction, Contingency and Logical Equivalences.

13. Show that the following expressions are logically equivalent by using truth table.

(a) ¬(p ∨ q) and ¬p ∧ ¬q.

(b) p → q and ¬p ∨ q.
(c) ¬p → (q → r) and q → (p ∨ r)

14. Verify whether the following logical expressions are a tautology or not by using truth
table.

(a) (p ∧ q) → (p → q)
(b) [¬p ∧ (p ∨ q)] → q.

15. Use De Morgan’s laws to express the negations of the following statements.

(a) Binod has a cellphone and he has a laptop computer.

(b) Gayle will go to the concert or Virat will go to the concert.

2
16. Show that the following compound propositions are logically equivalent by developing a
series of logical equivalences(Rules of logic).

(a) ¬[(p ∨ q) → r] and (p ∨ q) ∧ ¬r

(b) (p ∨ q) ∧ ¬(¬p ∧ q) and p
(c) p ∨ [p ∧ (p ∨ q)] and p
(d) [p ∨ q ∨ (¬p ∧ ¬q ∧ r)] and (p ∨ q ∨ r)
(e) (¬p ∨ ¬q) → (p ∧ q ∧ r) and p ∧ q

17. Show that the following propositions are tautology by rules of logic.

(a) (p ∧ q) → (p ∨ q)
(b) p → [q → (p ∧ q)]

18. Establish the validity of the arguments by using rules of inference.

(a) If Rahul hits a century, then he will get a car as gift.

Rahul will get a car as gift.
Therefore, Rahul hits a century.

(b) I will become famous or I will not become a musician.

I will become a musician.
Therefore I will become famous.

(c) If Ravi goes out with friends, then he will not study.
If Ravi does not study, then his father becomes angry.
His father is not angry.
Therefore Ravi has not gone out with friends.
(d) p → r
¬p → q
q→s

∴ ¬r → s
(e) p → q
q → (r ∧ s)
¬r ∨ (¬t ∨ u)
p∧t

∴u

(f) (¬p ∨ ¬q) → (r ∧ s)

r→t
¬t

∴p

3
19. Show that the premises, "If you send me an e-mail message, then I will finish writing the
program," "If you do not send me an e-mail message, then I will go to sleep early," and
"If I go to sleep early, then I will wake up feeling refreshed" lead to the conclusion "If I
do not finish writing the program, then I will wake up feeling refreshed."

20. Express the following sentences into logical expressions by using predicates and quanti-
fiers.

(a) Every mail message larger than one megabyte will be compressed.
(b) If a user is active, at least one network link will be available.
(c) For the universe of all triangles in the plane, "An equilateral triangle has three angles
of 60◦ , and conversely."
(d) Every student in this class has visited either Canada or Mexico.

21. Translate each of these statements into logical expressions using predicates, quantifiers,
and logical connectives. Choose the relevant domain.

(a) No one is perfect.

(b) Not everyone is perfect.
(c) All your friends are perfect.
(d) At least one of your friends is perfect.
(e) Everyone is your friend and is perfect.
(f) Not everybody is your friend or someone is not perfect.
(g) A passenger on an airline qualifies as an elite flyer if the passenger flies more than
25,000 miles in a year or takes more than 25 flights during that year.
(h) At least one mail message, among the nonempty set of messages, can be saved if
there is a disk with more than 10 kilobytes of free space.
(i) Whenever there is an active alert,all queued messages are transmitted.

22. Translate the following statements in to logical expressions

(a) The sum of two positive integers is always positive.

(b) Every real number except zero has a multiplicative inverse.

23. Problems on direct proof.

(a) If n is an odd integer, then n2 is odd.

(b) Prove that if m + n and n + p are even integers, where m, n, and p are integers, then
m + p is even.
(c) Proof that if m and n are both perfect squares, then mn is also a perfect square.

24. Problems on Method of Contraposition.

(a) For every integers n, if 3n + 2 is an odd integer, then n is odd.

√ √
(b) Prove that if n = ab, where a and b are positive integers, then a ≤ n or b ≤ n.
(c) Show that if n is an integer and n3 + 5 is odd, then n is even.

4
25. Problems on Method of Contradiction.

(a) Prove that if n is an integer and 3n + 2 is even, then n is even.

√
(b) Prove that 2 is an irrational number.
1
(c) If x is an irrational, then x
is irrational.

Unit - III

1. Define Graph, walk, path, trail, connected graph, complete graph, sub graph, bipartite
graph, isomorphic graphs, degree of a vertex.

2. Let S ={2, 3, 5, 8, 13, 21}. Draw the graph G whose vertex set is S and such that ij∈ E(G)
for i, j ∈ S if i + j ∈ S or |i − j| ∈ S.

3. Let S ={2, 3, 4, 7, 11, 13}. Draw the graph G whose vertex set is S and such that ij∈ E(G)
for i, j ∈ S if i + j ∈ S or |i − j| ∈ S.

4. The ten editors have decided on the seven committees: c1 = {1, 2, 3}, c2 = {1, 3, 4, 5}, c3 =
{2, 5, 6, 7}, c4 = {4, 7, 8, 9}, c5 = {2, 6, 7}, c6 = {8, 9, 10}, c7 = {1, 3, 9, 10}. They
have set aside three time periods for the seven committees to meet on those Fridays when
all ten editors are present. Some pairs of committees cannot meet during the same period
because one or two of the editors are on both committees. Model this situation by graph.

5. Write the word graph for a collection of 3-letter English words, say ACT, ARC, ARM,
ART, CAR, CAT, OAT, RAT. We say that a word W1 can be transformed into a word W2
if W2 can be obtained from W1 by performing exactly one of the following two steps: (1)
interchanging two letters of W1 ; (2) replacing a letter in W1 by another letter. Model the
graph such that one edge can be drawn if W1 can be transformed to W2 .

6. Let G be the graph as shown below, let X = {e, f }, where e = ru and f = vw, and let
U = {u, w}. Draw the sub graphs G − X and G − U of G.

7. For the above graph G give an example of each of the following or explain why no such
example exists.

(a) An x − y walk of length 6.

(b) A v − w trail that is not a v − w path.
(c) An r − z path of length 2.
(d) An x − z path of length 3.
(e) An x − t path of length d(x, t).
(f) A circuit of length 10.
(g) A cycle of length 8.

5
 8. Draw the graphs 2K4 ∪ C5 ∪ P3 and 3P4 ∪ C4 ∪ K4

9. Determine whether the graphs G1 and G2 given below are bipartite. If a graph is bipartite,
then redraw it indicating the partite sets; if not, then give an explanation as to why the
graph is not bipartite.

10. For the following pairs G, H of graphs, draw G + H and GXH.

(a) G = P3 and H = K2 .
(b) F = K5 and S = K2 .
X
11. If G is a graph of size m, then prove that deg(v) = 2m.
v∈V (G)

12. A certain graph G has order 14 and size 27. The degree of each vertex of G is 3, 4 or 5.
There are six vertices of degree 4. How many vertices of G have degree 3 and how many
have degree 5?

13. The degree of each vertex of a certain graph of order 12 and size 31 is either 4 or 6. How
many vertices of degree 4 are there?

14. The degree of every vertex of a graph G of order 25 and size 62 is 3, 4, 5 or 6. There
are two vertices of degree 4 and 11 vertices of degree 6. How many vertices of G have
degree 5?

15. For the graph G given below , construct a 3-regular graph H containing G as an induced
subgraph such that H has the smallest possible order. What is this order?

16. What is the minimum order of a 3-regular graph H containing the graph G in Figure
below as an induced subgraph?

17. Determine which of the following sequences are graphical? For each of those that are
graphical, construct a graph.

• s1 : 3, 3, 2, 2, 1, 1

6
 • s2 : 6, 5, 5, 4, 3, 3, 3, 2, 2
• s3 : 7, 7, 4, 3, 3, 3, 2, 1
• s4 : 6, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1

18. For the adjacency matrix A of the graph G1 , G2 and G3 of Figure below determine
A2 , A3 , without computing A or performing matrix multiplication.

1. Determine whether the following graphs are Isomorphic.

(a)

(b)

(c)

(d)

Unit - IV

1. Determine the cut-vertices, bridges and blocks of the following graph G.

2. Define Eulerian Trail, Euler graph,Hamiltonian path and Hamiltonian cycle.

3. Discuss Königsberg bridge problem.

7
4. The diagram below shows the nine rooms on the second floor of a large house with
doorways between various rooms. Is it possible to start in some room and go for a walk
so that each doorway is passed through exactly once? How is this question related to
graph theory?

5. Find an Euler circuit for the following graph also if the edge d, e is removed from this
graph, find an Euler trail for the resulting sub graph.

6. Determine whether the following graphs are Eulerian. If not, check whether the graph
contains an Eulerian trail.

(a)

(b)

7. The following figure shows a diagram of a modern art museum that is divided into 15
exhibition rooms. At the end of each day, a security officer enters the reception room
by the front door and checks each exhibition room to make certain that everything is in
order. It would be most efficient if the officer could visit each room only once and return
to the reception room. Can this be done?

8
 8. Determine whether the following graphs are Hamiltonian or not.

9. Discuss the traveling salesperson problem.

10. Find the length of a shortest path between a and z in the given weighted graphs.

(a) i. ii.

(b)

11. Prove that a graph G is a tree if and only if every two vertices of G are connected by a
unique path.

12. Prove that every tree of order n has size n − 1 .

13. The degrees of the vertices of a certain tree T of order 13 are 1, 2 and 5. If T has exactly
three vertices of degree 2, how many end-vertices does it have?

14. Prove that every forest of order n with k components has size n − k.

15. A certain tree T of order 21 has only vertices of degree 1, 3, 5 and 6. If T has exactly 15
end - vertices and one vertex of degree 6, how many vertices ofT have degree 5?

9
16. A certain tree T of order 35 is known to have 25 vertices of degree 1, two vertices of
degree 2, three vertices of degree 4, one vertex of degree 5 and two vertices of degree 6.
It also contains two vertices of the same (unknown) degree x. What is x?

17. Apply both Kruskal’s and Prim’s Algorithms, produces a minimum spanning tree in a
connected weighted graphs given below.

(a) i. ii.

(b) i. ii.

(c)

18. Determine the number of spanning trees of the following graphs.

(a) i. ii.

(b)

10