Scribd
Upload
1 views

Important Topics in Discrete Structures (1)

Uploaded by

Adithya Venkatesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1 views

Important Topics in Discrete Structures (1)

Uploaded by

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

Important topics in DISCRETE STRUCTURES

UNIT-I
1. Logic –
(i) Theory of Inference (Problems on proving direct
results and indirect results)
(ii) Quantifiers on single variables
(iii) Theory of inference for predicate calculus
(iv) PCNF and PDNF of compound statements using
truth tables and without truth table

2. Problems on principles of mathematical induction

3. Minsets

4. Combinatorics: Basic Counting techniques-Permutations and


Combinations
UNIT -2
1. Relations –
(i) Problems on Warshall’s Algorithm
(ii) Problems on equivalence relation
(iii) Problems on Partial order relation
(iv) Representing a relation using Digraphs and Matrices
(v) Partitions and equivalence classes, properties of
equivalence classes and Theorem on Equivalence
Classes: Every equivalence class partitions the set

2. Functions –
(i) Problems and theorems on one to one and onto function
(ii) Problems and theorems on composition of functions
(theorem 8, 9, 10 and 11 in DM by MKV)

3. Lattices –
(i) Problems on Hasse diagram representation of posets
(ii) Distributive inequality and Modular inequality
(iii) Modular and Distributive Lattices (Any chain is modular,
the lattice N_5 is not modular, N_5 is not distributive and
M_5 is modular but not distributive)
(iv) Theorems on Lattices (Theorem 1, 4, 5, 10, 14, 15, 20 and
worked examples 1, 4 in DM by MKV)

4. Boolean Algebra: (i) K-Maps and Quine McCluskey method to


simplify Boolean Polynomials
UNIT – 3
Recurrence Relations:
(i) Solution of first and second order Homogenous linear
recurrence relations
(ii) Solution of non-homogenous linear recurrence relations
with a constant RHS, polynomial RHS and exponential RHS
(iii) Problems on solving recurrence relations using generating
functions
(iv) Primitive recursive functions f(x,y) = x+y, x*y, x^y.
(v) Ackerman’s function

Unit 3
Graph Theory:
(i) Problems on Prims algorithm, Kruskal and Dijikstras
algorithm
(ii) Planarity - Euler's theorem on planarity
(iii) Eulerian graphs, Characterization of Eulerian graphs
(iv) Trees and its properties
(v) Proof of five color theorem
(vi) Problems based on chromatic polynomials
Important theorems:
1. The sum of the degrees of the points of a graph is twice the
number of edges.

2. In any graph G the number of points of odd degree is even.

3. Every cubic graph has an even number of points.

4. The maximum number of edges among all p point graph with


no triangles is [p^2/4], where [n] denotes greatest integer not
exceeding n.

5. A graph G with at least two points is bipartite if and only if all


its cycles are of even length.

6. A graph G with order n and k components has maximum


number of edges (n − k)(n − k + 1)/2.
7. For any graph G, k(G) ≤ λ(G) ≤ δ(G).

8. K_{3,3} is non planar.

9. K_5 is non planar.

10. The following statements are equivalent for a connected


graph:
(a) G is Eulerian.
(b) Every point of G has even degree.
(c) The set of edges of G can be partitioned into cycles.

11. Let G be a (p, q) graph. The following are equivalent:


(a) G is a tree.
(b) Every two points of G are joined by a unique path.
(c) G is connected and p = q + 1.
(d) G is acyclic and p = q + 1.

12. If G is a connected planar graph with V ,E and F as the


set of vertices, edges and faces respectively, then |V | − |E| + |
F| = 2.

13. The following statements are equivalent for any connected


graphs G:
(a) G is 2-colorable.
(b) G is bipartite.
(c) Every cycle of G has even length.
14. Every planar graph is five colorable
15. Chromatic polynomial of Kn is λ(λ − 1)(λ − 2) · · ·(λ − n + 1).
16. Chromatic polynomial of a tree with order at least 2 is λ(λ −
1)^{n−1}

UNIT- IV Algebraic Systems


1. Problems and theorems on Groups (refer MKV)
2. Problems and theorems on Abelian group (Every group of
order 4 is abelian)
3. Problems and theorem on subgroups (refer MKV)
4. Cyclic group (Every subgroup of a cyclic group is cyclic)
5. Lagrange’s theorem and its consequences
6. Fundamental theorem of homomorphism
7. Any two infinite cyclic groups are isomorphic to each other
(or) Every cyclic group of infinite order is isomorphic to Z, the
additive group of all integers.
8. Symmetric group S_n, in particular S_3
9. Permutation group
10. Direct product of two groups
11. Problems on Rings and Field
12. Every finite integral domain is a field
13. Problems on Error correction
1. Problems on principles of mathematical induction

2. Functions –
(i) Problems and theorems on one to one and onto
function
(ii) Problems and theorems on composition of
functions
(theorem 8, 9, 10 and 11 in DM by MKV)

Important theorems in Graph Theory


1. The sum of the degrees of the points of a graph is twice the
number of edges.

2. In any graph G the number of points of odd degree is even.

3. Every cubic graph has an even number of points.

4. The maximum number of edges among all p point graph with


no triangles is [p^2/4], where [n] denotes greatest integer not
exceeding n.

5. A graph G with at least two points is bipartite if and only if all


its cycles are of even length.
6. A graph G with order n and k components has maximum
number of edges (n − k)(n − k + 1)/2.

7. For any graph G, k(G) ≤ λ(G) ≤ δ(G).

8. K_{3,3} is non planar.

9. K_5 is non planar.

10. The following statements are equivalent for a connected


graph:
(a) G is Eulerian.
(b) Every point of G has even degree.
(c) The set of edges of G can be partitioned into cycles.

11. Let G be a (p, q) graph. The following are equivalent:


(a) G is a tree.
(b) Every two points of G are joined by a unique path.
(c) G is connected and p = q + 1.
(d) G is acyclic and p = q + 1.

12. If G is a connected planar graph with V ,E and F as the


set of vertices, edges and faces respectively, then |V | − |E| + |
F| = 2.
13. The following statements are equivalent for any connected
graphs G:
(a) G is 2-colorable.
(b) G is bipartite.
(c) Every cycle of G has even length.
14. Every planar graph is five colorable
15. Chromatic polynomial of Kn is λ(λ − 1)(λ − 2) · · ·(λ − n + 1).
16. Chromatic polynomial of a tree with order at least 2 is λ(λ −
1)^{n−1}

You might also like