Chapter 11 (Part 1):

Boolean Algebra

• Boolean Functions (11.1)

• Representing Boolean Functions
(11.2)
• Logic Gates (11.3)
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007
2011
2

• It has started from the book titled “The

laws of thought” written by George Boole
in 1854

• Claude Shannon showed how the basic

rules of logic could be used to design
circuits

• The circuit in electronic devices have

inputs, each of which is either 0 or 1 and
produce outputs that are also 0 or 1
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
3

• The operation of a circuit is defined by a

Boolean function that specifies the value
of an output for each set of inputs

• One of the goal is to describe methods for

finding a simplified expression (min
number of sums and products) that
represents a Boolean function (Karnaugh
maps).
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
4
Boolean Functions (11.1)
• Introduction

– Electronic and optimal switches are studied

using the set {0, 1} and the rules of Boolean
algebra

– The 3 operations in Boolean algebra that are

used are Complementation, Boolean Sum
and the Boolean Product

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
5
Boolean Functions (11.1) (cont.)

– Complement of an element is defined by:

0  1; 1  0

– Boolean sum denoted by + or by OR obeys:

1 + 1 = 1, 1+ 0 = 1, 0 + 1 = 1, 0 + 0 = 0

– Boolean product denoted by AND obeys:

1 . 1 = 1, 1 . 0 = 0, 0 . 1 = 0, 0 . 0 = 0.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
6
Boolean Functions (11.1) (cont.)

– Example: Find the value1  0  ( 0  1 )

Solution: 1  0  ( 0  1 )  0  1  0  0  0

• Boolean expressions & Boolean Functions

– Definition

Let B = {0, 1} then Bn = {(x1, x2, …, xn) such that xi 

B for 1  i  n}. The variable x is called a Boolean
variable if it assumes values only from B (0 or 1). A
function Bn to B is called a Boolean function of
Dr. Djamel degree n. H.504
© by Kenneth
CSE Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Discrete Structures & Foundations of
7
Boolean Functions (11.1) (cont.)
– Example: The functionF ( x , y )  xy from
B2 ={(x, y) such that (x, y)  {0, 1} * {0,1)}
is a Boolean function with:
F(1, 1) = 0, F(1, 0) = 1, F(0, 1) = 0, F(0, 0)
=0

– Example: Find the values ,z ) 

F ( xof, ythe xy  z
Boolean
function represented by

Solution: The values of this function are

displayed on the following table:
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel
8
Boolean Functions (11.1) (cont.)

x y z xy z F ( x , y , z )  xy  z

1 1 1 1 0 1
1 1 0 1 1 1
1 0 1 0 0 0
1 0 0 0 1 1
0 1 1 0 0 0
0 1 0 0 1 1
0 0 1 0 0 0
0 0 0 0 1 1
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
9 • Identities of Boolean algebra
Identity Name

xx Law of the double component

x+x=x x.x=x Idempotent laws

x+0=x x.1=x Identity laws
x+1=1 x.0=0 Domination laws
x+y=y+x xy = yx Commutative laws
x + (y + z) = (x + y) + z Associative laws
x(yz) = (xy)z
x + yz = (x + y) (x + z) Distributive laws

( xy )  x  y ( x  y )  x y De Morgan’s laws
x + xy = x x(x + y) = x Absorption laws
x x 1 Unit property

Dr. Djamel xx © by0Kenneth H. Rosen, Discrete Mathematics

Zero&property
its Applications, Seventh Edition, Mc Graw-Hill, 2011
10 Boolean Functions (11.1) (cont.)
– Example: Show that the distributive law
x(y + z) = xy + xz
Solution:
x y z y+z xy xz x(y + z) xy + xz
1 1 1 1 1 1 1 1
1 1 0 1 1 0 1 1
1 0 1 1 0 1 1 1
1 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
11
Boolean Functions (11.1) (cont.)

• Duality

– Goal: the dual of a Boolean expression is

obtained by interchanging Boolean sums and
Boolean products and interchanging 0s and
1s

– Example: Find
x .1 the  z ) of x (y + 0) and
( yduals
( x  0 )( yz )
Solution: the duals are x + (y.1) and
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
12
Boolean Functions (11.1) (cont.)
– The duality principle enables to obtain more
identities. Since an identity between
functions represented by Boolean
expressions remains valid when the duals
of both sides of the identity are taken

• The abstract definition of a Boolean

Algebra

– Goal: Recognize that a particular structure

(set, propositions,…) is a Boolean algebra
 all results of Boolean algebra will apply
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
13 Boolean Functions (11.1) (cont.)
– Definition 1:
A Boolean algebra is a set B with two
binary operations  and , elements 0 and
1, and a unary operation  such that these
properties hold for all x, y and z in B:
x  o  x
 Identity laws
x  1  x
x  x  1
Complement laws
x  x  0
(x  y)  z  x  ( y  z)
 Associative laws
(x  y)  z  x  ( y  z)
x  y  y  x
Commutative laws
x  y  y  x
x  (y  z)  ( x  y)  (x  z)
 Distributive laws
x  (y  z)  ( x  y)  (x  z)
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
14
Boolean Functions (11.1) (cont.)

– The set of propositions in n variables, with

the  and  operators, F and T, and the
negation operator, also satisfies all the
properties of a Boolean algebra

– Similarly, the set of subsets of a universal set

 with the union and intersection operators,
the empty set and the universal set, and the
set complementation operator is a Boolean
algebra

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
15 Representing Boolean Functions
(11.2)
• Two problems of Boolean algebra are
emphasized in this section

1. Given the values of a Boolean function,

how can a Boolean expression that
represents this function be found?

2. Is there a smaller set of operators that can

be used to represent all Boolean functions?

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
 Representing Boolean Functions (11.2)
16
(cont.)
• Sum-of-products expansions
– Goal: Find a Boolean expression that
represents a Boolean function
– Example: Find Boolean expressions that
represent the functions F(x, y, z) and G(x,
y, z) given by the following table:
x y z F G
1 1 1 0 0
1 1 0 0 1
1 0 1 1 0
1 0 0 0 0
0 1 1 0 0
0 1 0 0 1
0 0 1 0 0
0 Edition,
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh 0 0 Graw-Hill,
Mc 0 2011 0
Dr. Djamel
17 Representing Boolean Functions (11.2)
(cont.)
Solution:
x y z F G
1 1 1 00
 To form the Boolean expressions for the
1 1 0 01 function F(x,y,z), we need to look at the table
1 0 1 10 and notice that F has the value 1 only if x = 1
1 0 0 00 and y = 0 and z =1 otherwise F has value 0
0 1 1 00  F(x,y,z) =
xyz
0 1 0 0 1
0 0 1 0 0
0 0 0 0 0 To form the Boolean expression for the
function G(x,y,z), we have to notice that
G(x,y,z) = 1  x = y = 1 and z = 0 or x = z =
0 and y = 1; otherwise G(x,y,z) = 0
 G(x,y,z) = ( xyz )  ( xyz )
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
18 Representing Boolean Functions (11.2)
(cont.)
– Definition 1:

A literal is a Boolean variable or its

complement. A minterm of the Boolean
variables x1=, x2, …, xn is a Boolean product
y1y2…yn, where yi = xi or yi = xi . Hence, a
minterm is a product of n literals, with one
literal of each variable.

The minterm y1y2…yn, is 1 if and only if each

yi is 1, and therefore xi = 1 when yi = xi and xi
= 0 when yi x=i .
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
19 Representing Boolean Functions (11.2)
(cont.)
– Example: Find a minterm that equals 1 if
x1 = x3 = 0 and x2 = x4 = x5 = 1, and equals 0
otherwise

Solution: The minterm is: x1 x 2 x 3 x 4 x5

– Minterms are used to determine the Boolean

expression of a Boolean function in a table

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
20 Representing Boolean Functions (11.2)
(cont.)
– Example: Find the sum-of-products
expansion for the x , y , z )  ( x  y )z
F (function

Solution (1):
( x  y )z  xz  yz  x 1z  1 yz
 x(y  y)z  (x  x)yz
 xyz  xyz  xyz  xyz
 xyz  xyz  xyz (since u  u  u)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
21 Representing Boolean Functions (11.2)
(cont.)
Solution (2): We use the minterm technique
from a table
x y z x+y z (x + y) z
1 1 1 1 0 0
1 1 0 1 1 1
1 0 1 1 0 0
1 0 0 1 1 1
0 1 1 1 0 0
0 1 0 1 1 1
0 0 1 0 0 0
0 0 0 0 1 0

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
22 Representing Boolean Functions (11.2)
(cont.)
We need only to spot the set of values (x,y,z) for
which F ( x , y , z )  ( x  y )zThis
 1.set is:
{(1,1,0);(1,0,0);(0,1,0)}

We need to find the minterm that equals 1 if

(x  y  1 and z  0) OR (x  1 and y  z  0) OR (x  z  0 and y  1)

  
xyz + xyz + xyz
– Theorem 1: Every Boolean function can be
represented using the three Boolean operators .,
+, and – (complement)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
23 Representing Boolean Functions (11.2)
(cont.)
• Functional completeness

– The set{., +, -} is functionally complete

because of theorem 1
– Question: Can we find a smaller set of
functionally complete operators?
– We answer “yes” to this question if one of
the three operators can be expressed in
terms of the other two
– One of the De Morgan’s laws provide the
solution:
x  y  x y sin ce ( x  y )  x y
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
24 Representing Boolean Functions (11.2)
(cont.)
– Similarly, we have: xy  x  y

– Finally, we have found a smaller set

functionally complete; it contains only 2
operators!

– Question: Can we still reduce the set to only

one operator? The answer is “yes”.

– Indeed, there are 2 sets that contain only one

operator, they are: the NAND and the NOR.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
25 Representing Boolean Functions (11.2)
(cont.)
– NAND ( | ) is defined as
1|1 = 0 and 1|0 = 0|1= 0| =1

– NOR () is defined as

11 = 10 = 01 = 0 and 00 =1

– Since the set {., -} is functionally complete and

x= x|x, xy = (x|y) | (x|y) then the set {|} is
functionally complete.

– Home-exercise: Prove that the set {} is functionally

complete.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
26 Logic Gates (11.3)
• Introduction

– A computer, or electronic devices, is made

up of a number of circuits

– Each circuit can be designed using the

rules of Boolean algebra

– The basic element of circuits are called

gates

– Each type of gates implements a Boolean

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
Operation
27 Logic Gates (11.3) (cont.)

– All circuits studied in this chapter provides

output that depends only on the input, and
not on the current state of the circuit

– These circuits that have no memory

capabilities are called combinational
circuits or gating networks

– Combinatorial circuits are built using 3

types of elements: (1) inverter, (2) OR
gate,
Dr. Djamel and (3)H.AND
© by Kenneth
CSE 504 gate
Rosen, Discrete
Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Structures & Foundations of
28 Logic Gates (11.3) (cont.)
– Role of each type of elements:

1. Inverter: it accepts the value of one

Boolean variable as input and produces
the complement of this value as its
output.
x
x

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
29 Logic Gates (11.3) (cont.)

2. OR gate: it accepts as input values of 2

or more Boolean variables. The output is
the Boolean sum of their values

x
y x+y

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
30 Logic Gates (11.3) (cont.)

3. AND gate: The inputs to this gate are the

values of two or more Boolean variables.
The output is the Boolean product of their
values.
x xy
y

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
31 Logic Gates (11.3) (cont.)
– We can have multiple inputs to AND and
OR:

x1
x2
… x1x2…xn
xn

x1
x2 x1 + x2 + …+ xn
…
xn

Gates with n inputs

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
32 Logic Gates (11.3) (cont.)
• Combinations of Gates

– Combinational circuits can be constructed

using a combination of inverters, OR gates,
and AND gates

– When combinations of circuits are formed,

some gates may share input using
branching

– The following figure shows 2 ways of

Dr. Djamel
drawing theDiscrete
© by Kenneth H. Rosen,
CSE 504 Discrete
same circuit
Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Structures & Foundations of
 xy
33 x
y

x xy  xy
x
y xy

x xy
y

x xy  xy
xy

Two ways to draw the same circuit

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
34 Logic Gates (11.3) (cont.)
– Example: Construct circuits that produce
the following outputs:

a) ( x  y )x

b) x ( yz )

c) ( x  y  z )( x y z )

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
35 Logic Gates (11.3) (cont.)

– Solution for (a):

x x+y
y
( xxy y ) x

x
x

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
36 Logic Gates (11.3) (cont.)
– Solution for (b):

x x

y
x( y  z )
yz ( yz )

z z

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
37 Logic Gates (11.3) (cont.)
– Solution for (c):
x
y
z x+y+z

x
x
( x  y  z )( x y z )
y
y
x yz
z
z
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
38 Logic Gates (11.3) (cont.)
• Example of circuits

– Example: A committee of 3 individuals

decides issues for an organization. Each
individual votes either yes or no for each
proposal that arises. A proposal is passed
if it receives at least 2 yes votes. Design a
circuit that determines whether a proposal
passes.

Solution: We want to have the following

Boolean function: xy + xz + yz represented
by the following circuit:
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
39 Logic Gates (11.3) (cont.)

x xy
y

x xz
z xy + xz + yz

y yz
z

A circuit for majority voting

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
 Chapter 11 (Part 2):
Boolean Algebra

• Logic Gates (11.3) (cont.)

• Minimization of Circuits (11.4)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007
2011
 Chapter 9 (Part 2): Graphs

• Graph Terminology (9.2) (cont.)

• Representing Graphs &
Graph Isomorphism (9.3)
• Connectivity (9.4)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2011
42
Graph Terminology (9.2) (cont.)
• Some special simple graphs

– Complete graph

They are denoted by Kn, they contain exactly

one edge between each pair of distinct
vertices

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
43
Graph Terminology (9.2) (cont.)

K1 K2 K3 K4

The graphs Kn for

K5 1n6
K6
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
44
Graph Terminology (9.2) (cont.)

– Cycles

They are denoted by Cn(n  3): they consist

of n vertices v1, v2, …, vn and edges {v1, v2},
{v2, v3}, …, {vn, vn-1} and {vn, v1}

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
45
Graph Terminology (9.2) (cont.)

C3 C4

The cycles
C5 C3, C4, C5 & C6
C6
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
46
Graph Terminology (9.2) (cont.)

– Wheels

They are denoted by Wn; they are obtained

by adding a vertex to the graphs Cn and
connect this vertex to all vertices

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
47
Graph Terminology (9.2) (cont.)

W3 W4

The Wheels W3,

W5 W4, W5 & W6
W6
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
48
Graph Terminology (9.2) (cont.)

– n-cubes

They are denoted by Qn, they are graphs that

have vertices representing the 2n bit strings
of length n.

Two vertices are adjacent if and only if the

bits strings that they represent differ in
exactly one bit position

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
49
Graph Terminology (9.2) (cont.)

110 111
10 11 101
100
010
011

0 1 00 01 000 001

Q1 Q2 Q3

The n-cube Qn for n = 1, 2, and 3.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
50
Graph Terminology (9.2) (cont.)

• Bipartite graph

– Definition 5:

A simple graph is called bipartite if its vertex set V

can be partitioned into 2 disjoint sets V1 and V2
such that every edge in the graph connects a
vertex in V1 and a vertex in V2 (so that no edge in
G connects either 2 vertices in V1 or 2 vertices in
V2).

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
51
Graph Terminology (9.2) (cont.)

– Example: C6 is bipartite, since its vertex set can

be partitioned into the 2 sets V1 = {v1, v3, v5} and
V2 = {v2, v4, v6}, and every edge of C6 connects a
vertex in V1 and a vertex in V2.
V1 V2
v1 v2

v3 v4

v5 v6

– Example: K3 is not bipartite. Why?

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
52
Graph Terminology (9.2) (cont.)

– Characterization of bipartite graph

• A graph is bipartite if and only if it is possible to
color the vertices of the graph with at most 2
colors so that no 2 adjacent vertices have the
same color
• Example: Complete bipartite graphs: they are
denoted by Km,n. Their vertices set is
partitioned into 2 subsets of m and n vertices,
respectively. There is an edge between 2
vertices if and only if one vertex is in the first
subset and the other vertex is in the second
subset.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
53
Graph Terminology (9.2) (cont.)

K2,3 K3,3

K3,5
K2,6

Some complete bipartite graphs

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
54
Graph Terminology (9.2) (cont.)

• Some applications of special types of graphs

– Local area network

Goal: connecting computers as well as peripheral
devices in a building using a local area network
topology

– Some of these networks are based on a star

topology, where all devices are connected to a
central control device

– The star topology is equivalent to a K1,n complete

bipartite graph
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
55
Graph Terminology (9.2) (cont.)

– Other local area networks use a ring

topology  Cn graphs

– Finally, the hybrid topology which is

equivalent to a Wn graph is also used

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
56
Graph Terminology (9.2) (cont.)

(a) (b) (c)

Star, ring, and hybrid topologies for local area networks

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
57
Graph Terminology (9.2) (cont.)

– Interconnection networks for parallel

processing

• Linear arrays for processor connection

• Mesh network (Markovian neighborhood)

• Hypercube interconnection (generalization of n-

cubes)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
58
Representing Graphs & Graph Isomorphism
• Introduction

– Goal: Consists of choosing the most

convenient representation of a graph

– We need to determine whether 2 graphs are

isomorphic, this problem is important in
graph theory

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
59 Representing Graphs & Graph
Isomorphism (9.3) (cont.)
• Representing Graph

– List all the edges of the graph (no multiple

edges)

– Use adjacency list, which specifies the

vertices that are adjacent to each vertex of
the graph

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
60
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– Example: Use adjacency lists to describe this

simple graph. b
a c

e d

Vertex Adjacent vertices

Solution: a b, c, e
b a
c a, d, e
d c, e
e Discrete Mathematics
© by Kenneth H. Rosen, a, c,&dits Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
61
Representing Graphs & Graph Isomorphism (9.3) (cont.)

• Adjacency matrices
– To simplify computation, graphs can be
represented using matrices

• Adjacency matrix
• Incident matrix

– The adjacency matrix is defined as A = [aij]

such that
1 if {v i , v j } is an edge of G
a ij  
 0 otherwise
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
62
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– Example: Use a adjacency matrix to represent

this graph: a b

c d

Solution: We order the vertices a, b, c, d.

The matrix representing this graph is
0 1 1 1
1 0 1 0 

1 1 0 0
 
1 0 0 0
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
63
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– In case of pseudographs , the adjacency matrix is

not a binary matrix but is formed of elements that
represent the number of edges between 2
vertices
– Example: Use an adjacency matrix to represent
this pseudograph: a b

c
d
0 3 0 2
3 0 1 1
Solution: The adjacency matrix using  
The ordering of vertices a, b, c, d is: 0 1 1 2
 
2 1 2 0
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
64
Representing Graphs & Graph Isomorphism (9.3) (cont.)

• Incidence matrices

– Let G = (V,E) be an undirected graph.

– Incidence matrices are defined by the matrix

M = [mij] such that

1 if edge e j is incident with vertex v i

m ij  
0 otherwise

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
65
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– Example: Using an incidence matrix, represent

the following undirected graph:
v1 v2 e6 v3
e2
e4 e
e1 e3 5

v4 v5
e1 e2 e3 e4 e5 e6
v1 1 1 0 0 0 0 
Solution: v2 0 0 1 1 0 1 
 
v3 0 0 0 0 1 1
v4 1 0 1 0 0 0 
 
v5 0 1 0 1 1 0 
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
66
Representing Graphs & Graph Isomorphism (9.3) (cont.)

• Isomorphism of graphs

– Goal: is it possible to draw 2 graphs in the same

way?

– In chemistry, different graph compounds can have

the same molecular formula but can differ in
structure

– The graphs of these compounds cannot be drawn in

the same way

– Graphs having the same structure share common

properties
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
67
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– Definition 1:

The simple graphs G1 = (V1,E1) and G2 =

(V2,E2) are isomorphic if there is a one-to-
one and onto function f from V1 to V2 with the
property that a and b are adjacent in G1 if
and only if f(a) and f(b) are adjacent in G2, for
all a and b in V1. Such a function f is called
an isomorphism.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
68
Representing Graphs & Graph Isomorphism (9.3) (cont.)

– Example: Show that the graphs G = (V,E) and

H = (W,F) are isomorphic
u1 u2 v1 v2

u3 u4 v3 v4
G H
Solution: The function f with f(u1) = v1, f(u2) = v4, f(u3) = v3,
f(u4) = v2 is a one-to-one correspondence between V and
W. To see that this correspondence preserves adjacency,
note that adjacent vertices in G are u1 and u2, u1 and u3,
u2 and u4, and u3 and u4, and each of the pairs f(u1) = v1
and f(u2) = v4, f(u1) = v1 and f(u3) = v3, f(u2) = v4 and
f(u3) = v3, and f(u1) = v1 and f(u4) = v2 are adjacent in H.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
69
Connectivity (9.4)
• Goal: determination of paths within graphs

• Many problems can be modeled with paths

formed by traveling along the edges of graphs

• Some examples of problems are:

– Study the link between remote computers

– Efficient planning of routes for mail delivery
– Garbage pickup
– Diagnostic in computer networks

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
70
Connectivity (9.4) (cont.)

• Path
– Definition 1:
Let n be a nonnegative integer and G an undirected
graph. A path of length n from u to v in G is a sequence of
n edges e1, e2, …, en of G such that f(e1) = {x0, x1},
f(e2) = {x1, x2}, …, f(en) = {xn-1, xn}, where x0 = u and xn = v.
When the graph is simple, we denote this path by its
vertex sequence x0, x1, …, xn (since listing these vertices
uniquely determines the path). The path is a circuit if it
begins and ends at the same vertex, that is, if u = v, and
has length greater than zero. The path or circuit is said to
pass through the vertices x1, x2, …, xn-1 or traverse the
edges e1, e2, …, en. A path or circuit is simple if it does not
contain the same edge more than once.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
71
Connectivity (9.4) (cont.)

– Example:
a b c

d e f
In this simple graph a, d, c, f, e is a simple path of
length 4, since {a,d}, {d,c}, {c,f}, and {f,e} are all
edges.
However, d, e, c, a is not a path, since {e,c} is not an
edge.
Note that b, c, f, e, b is a circuit of length 4 since
{b,c}, {c,f}, {f,e}, and {e,b} are edges, and this path
begins and ends at b.
The path a, b, e,d,a,b, which is of length 5, is not
simple since it contains the edge {a,b} twice.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
72
Connectivity (9.4) (cont.)

– Definition 2:
Let n be a nonnegative integer and G a directed
multigraph. A path of length n from u to v in G is a
sequence of edges e1, e2, …, en of G such that
f(e1) = (x0, x1), f(e2) = (x1, x2), …, f(en) = (xn-1, xn),
where x0 = u and xn = v. When there are no
multiple edges in the directed graph, this path is
denoted by its vertex sequence x0, x1, …, xn. A
path of length greater than zero that begins and
ends at the same vertex is called a circuit or
cycle. A path or circuit is called simple it it does
not contain the same edge more than once.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
73
Connectivity (9.4) (cont.)

• Connectedness in undirected graphs

– Question asked:
When does a computer network have the
property that every pair of computers can
share information, if message can be sent
through one or more intermediate
computers?

– This question is equivalent to:

When is there always a path between 2
vertices in the graph?
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
74
Connectivity (9.4) (cont.)

– Definition 3:

An undirected graph is called connected if there is

a path between every pair of distinct vertices of
the graph

– Theorem 1:

There is a simple path between every pair of

distinct vertices of a connected undirected graph

Proof: Exercise!
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
75
Connectivity (9.4) (cont.)

– A graph that is not connected is the union of

two or more connected subgraphs, each pair
of which has no vertex in common.

– These disjoint connected subgraphs are

called the connected components of the
graph

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
76
Connectivity (9.4) (cont.)

• Connected in directed graphs

– Definition 4:

A directed graph is strongly connected if there is a path

from a to b and from b to a whenever a and b are vertices
in the graph

– Definition 5:

A directed graph is weakly connected if there is a path

between every 2 vertices in the underlying undirected
graph
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
77
Connectivity (9.4) (cont.)

– A directed graph is weakly connected 

there is always a path between 2 vertices
when the directions of the edges are ignored

– Strongly connected  weakly connected

directed graph

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
78
Connectivity (9.4) (cont.)

– Example: Are the directed graphs G and H

strongly connected?
a b a b

c c
G H
e d e d
Solution: G is strongly connected because there is a path
between any 2 vertices in this directed graph. Hence, G is
also weakly connected.
The graph H is not strongly connected. There is no directed
path from a to b in this graph. However, H is weakly
connected, since there is a path between any 2 vertices in
their underlying undirected graph of H.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
79
Connectivity (9.4) (cont.)

• Paths & isomorphism

– Paths and circuits can help determine

whether 2 graphs are isometric

– The existence of a simple circuit (or cycle) of

a particular length is a useful invariant to
show that 2 graphs are not isomorphic

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
80
Connectivity (9.4) (cont.)

– Example: Determine whether the graph G and H

are isomorphic. u1 v1
u6 u2 v6 v2

G u3 H v3
u5 v5
u4 v4
Solution: Both G and H have 6 vertices and 8 edges. Each has 4
vertices of degree 3, and two vertices of degree 2. However, H has a
simple circuit of length 3, namely, v1, v2, v6, v1 whereas G has no
simple circuit of length 3, as can be determined by inspection (all
simple circuits in G have length at least four). Since the existence of a
simple circuit of length 3 is an isomorphic invariant, G and H are not
isomorphic.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
81
Connectivity (9.4) (cont.)

• Counting paths between vertices

– Theorem 2:

Let G be a graph with adjacency matrix A with

respect to the ordering v1, v2, …, vn (with directed
or undirected edges, with multiple edges and
loops allowed). The number of different paths of
length r from vi to vj, where r is a positive integer
is equals to the (i, j)th entry of Ar.

Proof: Exercise!
Dr. Djamel © by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
CSE 504 Discrete Structures & Foundations of
82
Connectivity (9.4) (cont.)

– Example: How many paths of length 4 are there

from a to d in the simple graph G?

a b

d c

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
83a b
Connectivity (9.4) (cont.)
d c
G
Solution: The adjacency matrix of G (ordering the vertices as a, b, c, d) is
0 1 1 0 
1 0 0 1 
A .
1 0 0 1
 
 0 1 1 0 
Hence, the number of paths of length 4 from a to d is the (1,4)th entry of
A4. Since 8 0 0 8 
0 8 8 0 
A 
4 .
0 8 8 0 
 
 8 0 0 8 
there are exactly 8 paths of length 4 from a to d. By inspection of the
graph, we see that a, b, a, b, d; a, b, a, c, d; a, b, d, b, d; a, b, d, c, d; a,
c, a, b, d; a, c, a, c, d; a, c, d, b, d; and a, c, d, c, d are the 8 paths from a
to d.
Dr. Djamel © by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
CSE 504 Discrete Structures & Foundations of
84 Logic Gates (11.3) (cont.)
• Adders
– Question: How can we carry out operations such
as additions of two positive integers (in binary
expansion) using logic circuits?
– We first build a circuit that can be used to
determine
x + y where x andInput
y are two bits
Output
x y s c
1 1 0 1
1 0 1 0
0 1 1 0
0 0 0 0
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
85
Logic Gates (11.3) (cont.)

– The output consists of two bits s and c

which are the sum bit and the carry bit
respectively

– From the previous table, we can write:

s  xy  xy  ( x  y )( xy )
i.
ii. c = xy

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
86
Logic Gates (11.3) (cont.)

– The following circuit called half adder

illustrates the sum of two bits with carry

x x+y
y
Sum  ( x  y )( xy )

x xy xy
y
Carry = xy

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
87 – We need to compute the sum bit and the carry bit
when two bits and a carry are added
– The inputs to this full adder are the bits x and y and
the carry ci
– The outputs are the sum bit s and the new carry ci+1.
Input Output
x y ci s Ci+ 1

1 1 1 1 1
1 1 0 0 1
1 0 1 0 1
1 0 0 1 0
0 1 1 0 1
0 1 0 1 0
0 0 1 1 0
0 0 0 0 0
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
88
Logic Gates (11.3) (cont.)

– The two outputs of the full adder, the sum bit

s and the carry ci+1 are given by the sum-of-
products expansion

xyci  xyci  xyci  xyci

and xyci  xyci  xyci  xyci respectively

– The full adder circuit using half adders is

depicted in the following picture

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
89
Logic Gates (11.3) (cont.)

ci Half
( x  y )( xy )
adder s  xyci  xyci  xyci  xyci

x Half
y adder xy
ci 1  xyci  xyci  xyci  xyci

A full adder
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
90 Logic Gates (11.3) (cont.)
– Finally, the following figure shows how the
half and the full adders can be combined to
add the two three-bit integers (x2x1x0)2 and
(y2y1y0)2 to produce the sum (s3s2s1s0)2
x0 Half s0
y0 adder c0 s1
Full
x1
Adder ci
y1 s2
Full
x2
Adder
y2 c2 = s 3

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
91 Minimization of Circuits (11.4)
• Introduction

– Goal: Representing circuits with Boolean

expressions having fewer operations

– Example: a circuit has output 1 if and only if:

x = y = z = 1 or x = z = 1 and y = 0. The sum-of-
product of this circuit is:
xyz  xyz  ( y  y )( xz)  1.( xz)  xz.
– xz is a Boolean expression with fewer operators
that represents the circuit

– Therefore, there are 2 different implementations of

this circuit as depicted in the following picture
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
92
Minimization of circuits (11.4) (cont.)

x xyz
y
z

xyz  xyz

x
y
y
z xyz

x xz
z

Two circuits with the same output

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
93
Minimization of circuits (11.4) (cont.)

• Karnaugh maps

– Goal: reduce the number of terms in a

Boolean expression representing a circuit

– Question: How can we find terms to combine

for Boolean functions for a relatively small
number of variables?

– Answer: There is a method introduced by

Maurice Karnaugh in 1953 for fewer
variables.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
94
Minimization of circuits (11.4) (cont.)

– K-map was designed in 1950 to help

minimize circuits by hand

– K-maps are useful in the minimization of

circuits with up to 6 variables only

– K-maps are inapplicable when dealing with

50, 100, or 1000 variables

– The minimization problem with respect to the

number of variables is NP-complete
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
95
Minimization of Circuits (11.4) (cont.)
– Principle
• K-maps for two variables:
– There are 4 possible minterms in the sum-of-product
expansion of a Boolean function in 2 variables x and
y

– Adjacent cells are those whose minterms differ in

exactly one litteral as shown in the following figure.
y y
– A k-map for a Boolean function in two variables
x xy xy consists of 4 cells, where a 1 is placed in the cell
representing a minterm if this minterm is present in
the expansion
x xy xy
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
96 Minimization of circuits (11.4) (cont.)
• Example: Find the K-maps for:
xy  xy
a)
b) xy  xy
c) xy  xy  xy

Solution: We include a 1 in a cell when the

minterm represented by this cell is present
in the sum-of-products expansion.
y y y y y y

x 1 x 1 x 1

x 1 x
1 x 1 1

Dr. Djamel (a) (b) & its Applications, Seventh Edition,(c)

© by Kenneth H. Rosen, Discrete Mathematics Mc Graw-Hill, 2011
97
Minimization of circuits (11.4) (cont.)

• Whenever there are 1’s in two adjacent cells, the

minterms are combined into a product involving
just one of the variables

• We circle blocks of cells in the K-maps that

represent minterms that can be combined and
then find the corresponding sum of the products

• The goal is to identify the largest possible blocks,

and to cover all the 1s with the fewest blocks
using the largest blocks first and always using the
largest possible blocks.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
98 • Example: Simplify the following sum-of-products
expansions:
a) xy  xy
b) xy  xy
c) xy  xy  xy
Solution: The grouping of minterms is shown in the
following figure. Using the k-maps for these
expansions Minimal expansions for these sums-of-
products  xy
xy are: x y
(a) y; (b) ; and (c) .
y y y y y y

x 1 x 1 x 1

x 1 x
1 x 1 1

(a) (b) (c)

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of
99
Minimization of Circuits (11.4) (cont.)

– Conclusion:

• Within a block of adjacent cells, we need to

take the common expression

• We need to sum minterms of all blocks.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Seventh Edition, Mc Graw-Hill, 2011
Dr. Djamel CSE 504 Discrete Structures & Foundations of