Lesson 1:

1. List the members of these sets.

a) {x | x is a real number such that x2 = 1}
b) {x | x is a positive integer less than 12}
c) {x | x is the square of an integer and x < 8. Determine whether each of these sets is
100} the power set of a set, where a and b are
d) {x | x is an integer such that x2 = 2} distinct elements.
2. Determine whether each of these pairs of a) ∅
sets are equal.
a) {1, 3, 3, 3, 5, 5, 5, 5, 5},{5, 3, 1} b) {∅,{a}}
b) {{1}},{1,{1}} c) {∅,{a},{∅, a}}
c) ∅,{∅}
d) {∅,{a},{b},{a, b}}
3. For each of the following sets, determine
9. Let A be the set of students who live
whether 2 is an element of that set.
within one mile of school and let B be the
a) {x ∈ R | x is an integer greater than 1} set of students who walk to classes. Describe
b) {x ∈ R | x is the square of an integer} the students in each of these sets.
a) A ∩ B
c) {2,{2}}
d) {{2},{{2}}} b) A ∪ B
e) {{2},{2,{2}}} c) A − B
f ) {{{2}}} d) B – A
4. Determine whether each of these 10. Let A = {1, 2, 3, 4, 5} and B = {0, 3, 6}.
statements is true or false. Find
a) 0 ∈ ∅ a) A ∪ B.
b) ∅∈{0} b) A ∩ B.
c) A − B.
c) {0}⊂∅ d) B – A
d) ∅⊂{0} 11. Prove the domination laws in Table 1 by
showing that a) A ∪ U = U. b) A ∩∅=∅.
e) {0}∈{0}
12. Let A = {0, 2, 4, 6, 8, 10}, B = {0, 1, 2,
f ) {0}⊂{0} 3, 4, 5, 6}, and C = {4, 5, 6, 7, 8, 9, 10}.
g) {∅} ⊆ {∅} Find
a) A ∩ B ∩ C.
5. Use a Venn diagram to illustrate the set of
all months of the year whose names do not b) A ∪ B ∪ C.
contain the letter R in the set of all months c) (A ∪ B) ∩ C.
of the year.
6. Use a Venn diagram to illustrate the d) (A ∩ B) ∪ C.
relationships A ⊂ B and B ⊂ C 13. Draw the Venn diagrams for each of
these combinations of the sets A, B, and C.
7. What is the cardinality of each of these
a) A ∩ (B − C)
sets?
a) {a} b) (A ∩ B) ∪ (A ∩ C)
b) {{a}} c) (A ∩ B) ∪ (A ∩ C)
c) {a,{a}}
d) {a,{a},{a,{a}}}
14. There are 35 students in art class and 57
students in dance class. Find the number of
students who are either in art class or in
dance class.
15. In a group of 100 persons, 72 people can
speak English and 43 can speak French.
How many can speak English only? How
many can speak French only and how many
can speak both English and French?
games. Find the number of players who only
play soccer, golf, and tennis.
21. Let A = {a, b, c, d} and B = {y,z}. Find
a) A × B. b) B × A.
22. Find A2 if a) A = {0, 1, 3}. b) A = {1, 2,
a, b}.
23. Find the truth set of each of these
predicates where the domain is the set of
integers. a) P (x): x2 < 3 b) Q(x): x2 > x c)
R(x): 2x + 1 = 0

16. In a competition, a school awarded

medals in different categories. 36 medals in
dance, 12 medals in dramatics and 18
medals in music. If these medals went to a
total of 45 persons and only 4 persons got
medals in all the three categories, how many
received medals in exactly two of these
categories?
17. Each student in a class of 40 plays at
least one indoor game chess, carrom and
scrabble. 18 play chess, 20 play scrabble and
27 play carrom. 7 play chess and scrabble,
12 play scrabble and carrom and 4 play
chess, carrom and scrabble. Find the number
of students who play (i) chess and carrom.
(ii) chess, carrom but not scrabble.
18. There are 40 students in a class. 20 take
Chemistry and 25 take French. 8 students
take both.
1. Find how many students take none.
2. How many are there in at least one
classes?
19. At a breakfast buffet, 20 people chose
coffee and 17 chose juice. 10 people chose
both coffee and juice. If each person chose
at least one of these beverages, how many
people visited the buffet?
20. There are 30 players in a group.10 play
soccer, 12 play tennis, 15 play golf. 3
players play both soccer and tennis. 5
players play both tennis and golf. 4 players
play both soccer and golf. 2 play all three
Lesson 1 Answers:
1. 7.
a) {−1,1} a) 1
b) {1,2,3,4,5,6,7,8,9,10,11} b) 1
c) {0,1,4, 9, 16, 25, 36, 49, 64, 81} c) 2
d) 3
d) ∅ 8.
2. a) ∅
a) Yes
b) {∅,{a},{∅,a}}
b) No
c) No c) {∅,{a},{∅,a}}
3. d)
a) Yes
{∅,{a},{b},{a,b},{∅,a},{∅,b},{∅,a,b}}
b) No
c) Yes 9.
d) No a) The set of students who live within one
e) No mile of school and walk to classes
f) No b) The set of students who live within one
4. mile of school or walk to classes (or do
a) False both)
b) False c) The set of students who live within one
c) False mile of school but do not walk to classes
d) True d) The set of students who walk to classes
e) False but live more than one mile away from
f) False school
g) True 10.
5. a) {0,1,2,3,4,5,6}
b) {3}
c) {1, 2, 4,5}
d) {0, 6}
11.
a) A ∪ U = {x | x ∈ A ∨ x ∈ U}={x | x
∈ A ∨ T} = {x | T} = U

6
b) A ∩∅={x | x ∈ A ∧ x ∈ ∅} = {x | x 19.
The number of people visited the buffet is
∈ A ∧ F}={x | F}=∅ 10+10+7 = 27
12.
a) {4,6}
b) {0,1,2,3,4,5,6,7,8,9,10} 20.
c) {4, 5, 6, 8, 10}  The number of players who play only
d) {0,2,4, 5,6,7,8,9,10} soccer = 5
13.  The number of players who play only
tennis = 6
 The number of players who play only
golf = 8

2. The number of players who play

none of the

given game = 3

22.
a) {(0, 0),(0, 1),(0, 3),(1, 0),(1, 1),(1, 3),(3,
0),(3, 1), (3, 3)} b) {(1, 1), (1, 2), (1, a), (1,
b), (2, 1), (2, 2), (2, a), (2, b),(a, 1),(a, 2),(a,
a),(a, b),(b, 1),(b, 2),(b, a),(b, b)}
23.
a) {−1, 0, 1}
b) Z− {0, 1}
14.
c) ∅
n(A) = 35, n(B) = 57, n(A ∩ B) = 12
15.
Therefore, Number of people speaking
English only = 57

Number of people speaking French only =

28
16.
= 13
17.
Therefore, Number of students who play
chess and carrom are 10.
Also, number of students who play chess,
carrom and not scrabble=6
18.
1. The number of students who had taken
none is 3
2. There are 37 students in at least one
class.

Lesson 2:
1. Let p and q be the propositions p : It is
below freezing. q : It is snowing. Write these
propositions using p and q and logical
connectives (including negations).
a) It is below freezing and snowing.
b) It is below freezing but not snowing.
c) It is not below freezing and it is not
snowing.
d) It is either snowing or below freezing (or
both).
e) If it is below freezing, it is also snowing.
f ) Either it is below freezing or it is
snowing, but it is not snowing if it is below
freezing.
g) That it is below freezing is necessary and
sufficient
2. Let p and q be the propositions p : You
drive over 65 miles per hour. q : You get a
speeding ticket. Write these propositions
using p and q and logical connectives
(including negations).
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.
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.
g) Whenever you get a speeding ticket, you
are driving over 65 miles per hour.
3. Let p, q, and r be the propositions p :
Grizzly bears have been seen in the area. q :
Hiking is safe on the trail. r : Berries are ripe
along the trail. Write these propositions
using p, q, and r and logical connectives
(including negations).
a) Berries are ripe along the trail, but grizzly
bears have not been seen in the area.
b) Grizzly bears have not been seen in the
area and hiking on the trail is safe, but
berries are ripe along the trail.
c) If berries are ripe along the trail, hiking is
safe if and only if grizzly bears have not
been seen in the area.
d) It is not safe to hike on the trail, but
grizzly bears have not been seen in the area
and the berries along the trail are ripe.
e) For hiking on the trail to be safe, it is
necessary but not sufficient that berries not
be ripe along the trail and for grizzly bears
not to have been seen in the area.
f ) Hiking is not safe on the trail whenever
grizzly bears have been seen in the area and
berries are ripe along the trail.
4. State the converse, contrapositive, and
inverse of each of these conditional
statements.
a) If it snows today, I will ski tomorrow.
b) I come to class whenever there is going to
be a quiz.
c) A positive integer is a prime only if it has
no divisors other than 1 and itself
5. Construct a truth table for each of these
compound propositions.
a) p ∧ ¬p
b) p ∨ ¬p
c) (p ∨ ¬q) → q
d) (p ∨ q) → (p ∧ q)
e) (p → q) ↔ (¬q → ¬p)
f ) (p → q) → (q → p)
6. Find the bitwise OR, bitwise AND, and
bitwise XOR of each of these pairs of bit
strings. a) 101 1110, 010 0001 b) 1111
0000, 1010 1010 c) 00 0111 0001, 10 0100
1000 d) 11 1111 1111, 00 0000 0000
7. Find the output of each of these
combinatorial circuits.

8. Construct a combinatorial circuit using
inverters, OR gates, and AND gates that
produces the output ((¬p ∨ ¬r) ∧ ¬q) ∨
(¬p ∧ (q ∨ r)) from input bits p, q, and r.
9. Use truth tables to verify these
equivalences.
a) p ∧ T ≡ p
b) p ∨ F ≡ p
c) p ∧ F ≡ F
d) p ∨ T ≡ T
e) p ∨ p ≡ p f ) p ∧ p ≡ p
10. Show that each of these conditional
statements is a tautology by using truth
tables.
a) (p ∧ q) → p
b) p → (p ∨ q)
c) ¬p → (p → q)
d) (p ∧ q) → (p → q)
e) ¬(p → q) → p f ) ¬(p → q) → ¬q
11. Let P (x) denote the statement “x ≤ 4.”
What are these truth values?
a) P (0)
b) P (4)
c) P (6)
12. Let P (x) be the statement “x spends
more than five hours every weekday in
class,” where the domain for x consists of all
students. Express each of these
quantifications in English.
13. Translate these statements into English,
where C(x) is “x is a comedian” and F (x) is
“x is funny” and the domain consists of all
people.
14. Let P (x) be the statement “x can speak
Russian” and let Q(x) be the statement “x
knows the computer language C++.”
Express each of these sentences in terms of
P (x), Q(x), quantifiers, and logical
connectives. The domain for quantifiers
consists of all students at your school. a)
There is a student at your school who can
speak Russian and who knows C++. b)
There is a student at your school who can
speak Russian but who doesn’t know C++.
c) Every student at your school either can
speak Russian or knows C++. d) No student
at your school can speak Russian or knows
C++.
16. Determine the truth value of each of
these statements if the domain consists of all
integers.
a) ∀n(n + 1 > n)
b) ∃n(2n = 3n)
c) ∃n(n = −n) d) ∀n(3n ≤ 4n)
17. Determine the truth value of each of
these statements if the domain for all
variables consists of all integers.
18. Translate in two ways each of these
statements into logical expressions using
predicates, quantifiers, and logical
connectives. First, let the domain consist of
the students in your class and second, let it
consist of all people.
a) Someone in your class can speak Hindi.
b) Everyone in your class is friendly.
c) There is a person in your class who was
not born in California.
d) A student in your class has been in a
movie.
e) No student in your class has taken a
course in logic programming.
19. Translate each of these statements into
logical expressions in three different ways
by varying the domain and by using
predicates with one and with two variables.
a) A student in your school has lived in
Vietnam. b) There is a student in your
school who cannot speak Hindi. c) A student
in your school knows Java, Prolog, and C++.
d) Everyone in your class enjoys Thai food.
e) Someone in your class does not play
hockey

Lesson 2 Answers
1.
a) p ∧ q b) p ∧ ¬q c) ¬p ∧ ¬q d) p ∨ q e)
p → q f) (p ∨ q) ∧ (p →¬q) g) q ↔ p
2.
a) ¬p b) p ∧ ¬q c) p → q d) ¬p → ¬q e) p
→ q f) q ∧ ¬p g) q → p
3.
a) r ∧¬p b) ¬p∧q ∧r c) r → (q ↔ ¬p) d) ¬
q∧ ¬p ∧ r e) (q →(¬r ∧ ¬p)) ∧ ¬((¬r ∧
¬p) → q) f) (p ∧ r) → ¬q
6.
4. a) Bitwise OR is 111 1111; bitwiseAND is
a) Converse: “I will ski tomorrow only if it 000 0000; bitwiseXORis 111 1111. b)
snows today.” Contrapositive: “If I do not Bitwise OR is 1111 1010; bitwise AND is
ski tomorrow, then it will not have snowed 1010 0000; bitwise XOR is 0101 1010. c)
today.” Inverse: “If it does not snow today, Bitwise OR is 10 0111 1001; bitwise AND
then I will not ski tomorrow.” b) Converse: is 00 0100 0000; bitwise XOR is 10 0011
“If I come to class, then there will be a 1001. d) Bitwise OR is 11 1111 1111;
quiz.” Contrapositive: “If I do not come to bitwise AND is 00 0000 0000; bitwise XOR
class, then there will not be a quiz.” Inverse: is 11 1111 1111.
“If there is not going to be a quiz, then I 7.
don’t come to class.” c) Converse: “A
positive integer is a prime if it has no 8.
divisors other than 1 and itself.”
Contrapositive: “If a positive integer has a
divisor other than 1 and itself, then it is not
prime.” Inverse: “If a positive integer is not
prime, then it has a divisor other than 1 and
itself.” 2
5.
 a) T b) T c) F
12.
a) There is a student who spends more than
5 hours every weekday in class. b) Every
student spends more than 5 hours every
weekday in class. c) There is a student who
does not spend more than 5 hours every
weekday in class. d) No student spends more
than 5 hours every weekday in class
9. 13.
a) Every comedian is funny. b) Every person
is a funny comedian. c) There exists a
person such that if she or he is a comedian,
10. then she or he is funny. d) Some comedians
are funny
14.
a) ∃x(P (x) ∧ Q(x)) b) ∃x(P (x) ∧ ¬Q(x))
c) ∀x(P (x)∨Q(x)) d) ∀x¬(P (x) ∨ Q(x))
15. Let P (x) be the statement “x = x2.” If
the domain consists of the integers, what are
these truth values? a) P (0) b) P (1) c) P (2)
d) P (−1) e) ∃xP (x) f ) ∀xP (x)
16.
a) T b) T c) T d) T
17.
a) P (0) ∨ P (1) ∨ P (2) ∨ P (3) ∨ P (4) b)
P (0) ∧ P (1) ∧ P (2) ∧ P (3) ∧ P (4) c)
¬P (0) ∨ ¬P (1) ∨ ¬P (2) ∨ ¬P (3) ∨ ¬P
(4) d) ¬P (0) ∧ ¬P (1) ∧ ¬P (2) ∧¬P (3)
∧ ¬P (4) e) ¬(P (0) ∨ P (1) ∨ P (2) ∨ P
(3) ∨ P (4)) f) ¬(P (0) ∧ P (1) ∧ P (2) ∧ P
(3) ∧ P (4))
18.
a) ∃xH (x) and ∃x(C(x) ∧ H (x)), where
H (x) is “x can speak Hindi” b) ∀xF (x) and
∀x(C(x) → F (x)), where F (x) is “x is
friendly” c) ∃x¬B(x) and ∃x(C(x) ∧
¬B(x)), where B(x) is “x was born in
11. California” d) ∃xM(x) and
∃x(C(x)∧M(x)), where M(x) is “x has Thai)). e) If we let H (x) be “x plays
hockey,” then we have ∃x ¬H (x) if the
been in a movie” e) ∀x¬L(x) and ∀x(C(x)
→ ¬L(x)), where L(x) is “x has taken a domain is just your classmates, or ∃x(Y (x)
course in logic programming” ∧ ¬H (x)) if the domain is all people. If we
19.
let P (x, y) mean that person x plays game y,
Let Y (x) be the propositional function that x
is in your school or class, as appropriate. a) then we can rewrite this last one as ∃x(Y
If we let V (x) be “x has lived in Vietnam,” (x) ∧ ¬P (x, hockey))
then we have ∃xV (x) if the domain is just
your schoolmates, or ∃x(Y (x) ∧ V (x)) if
the domain is all people. If we let D(x, y)
mean that person x has lived in country y,
then we can rewrite this last one as ∃x(Y
(x) ∧ D(x, Vietnam)). b) If we let H (x) be
“x can speak Hindi,” then we have ∃x¬H
(x) if the domain is just your schoolmates, or
∃x(Y (x) ∧ ¬H (x)) if the domain is all
people. If we let S(x, y) mean that person x
can speak language y, then we can rewrite
this last one as ∃x(Y (x) ∧ ¬S(x, Hindi)).
c) If we let J (x), P (x), and C(x) be the
propositional functions asserting x’s
knowledge of Java, Prolog, and C++,
respectively, then we have ∃x(J (x) ∧ P (x)
∧ C(x)) if the domain is just your
schoolmates, or ∃x(Y (x) ∧ J (x) ∧ P (x)
∧ C(x)) if the domain is all people. If we let
K(x, y) mean that person x knows
programming language y, then we can
rewrite this last one as ∃x(Y (x) ∧ K(x,
Java) ∧ K(x, Prolog) ∧K(x, C++)). d) If
we let T (x) be “x enjoys Thai food,” then
we have ∀x T (x) if the domain is just your
classmates, or ∀x(Y (x) → T (x)) if the
domain is all people. If we let E(x, y) mean
that person x enjoys food of type y, then we
can rewrite this last one as ∀x(Y (x) → E(x,

Lesson 3:
1. List the ordered pairs in the relation R
from A = {0, 1, 2, 3, 4} to B = {0, 1, 2, 3},
where (a, b) ∈ R if and only if a) a = b. b) a
+ b = 4. c) a>b. d) a | b. e) gcd(a, b) = 1. f )
lcm(a, b) = 2.
2. For each of these relations on the set {1,
2, 3, 4}, decide whether it is reflexive,
whether it is symmetric, whether it is
antisymmetric, and whether it is transitive.
a) {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)}
b) {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
c) {(2, 4), (4, 2)} d) {(1, 2), (2, 3), (3, 4)} e)
{(1, 1), (2, 2), (3, 3), (4, 4)} f ) {(1, 3), (1,
4), (2, 3), (2, 4), (3, 1), (3, 4)}
3. Determine whether the relation R on the
set of all Web pages is reflexive, symmetric,
antisymmetric, and/or transitive, where (a,
b) ∈ R if and only if a) everyone who has
visited Web page a has also visited Web
page b. b) there are no common links found
on both Web page a and Web page b. c)
there is at least one common link on Web
page a and Web page b. d) there is a Web
page that includes links to both Web page a
and Web page b.
4. Determine whether the relation R on the
set of all integers is reflexive, symmetric,
antisymmetric, and/or transitive, where (x,
y) ∈ R if and only if a) x = y. b) xy ≥ 1. c) x
= y + 1 or x = y − 1. d) x ≡ y (mod 7). e) x is
a multiple of y. f ) x and y are both negative
or both nonnegative. g) x = y2. h) x ≥ y2.
5. Let R1 and R2 be the “congruent modulo
3” and the “congruent modulo 4” relations,
respectively, on the set of integers. That is,
R1 = {(a, b) | a ≡ b (mod 3)} and R2 = {(a,
b) | a ≡ b (mod 4)}. Find a) R1 ∪ R2. b) R1
∩ R2. c) R1 − R2. d) R2 − R1. e) R1 ⊕ R2.
6. Let R be the relation on the set of people
consisting of pairs (a, b), where a is a parent
of b. Let S be the relation on the set of
people consisting of pairs (a, b), where a and
b are siblings (brothers or sisters). What are
S ◦ R and R ◦ S?
7. (Recognize whether several important
relations are reflexive or not.) Which of the
following statements are True and which are
False? (a) (∀x ∈ R)(x = x).
(b) (∀x ∈ R)(x 6= x).
(c) (∀x ∈ R)(x < x).
(d) (∀x ∈ R)(x ≥ x).
(e) (∀a ∈ N)(a | a).
8. (Be able to show a relation is an
equivalence.) On the set of real numbers R =
{x : −∞ < x < ∞} define the relation S = {(x,
y) : x, y ∈ R, and x − y is an integer}
Lesson 3 Answers:
1.
a) {(0, 0), (1, 1), (2, 2), (3, 3)} b) {(1, 3), (2,
2), (3, 1), (4, 0)} c) {(1, 0), (2, 0), (2, 1), (3,
0), (3, 1), (3, 2), (4, 0), (4, 1), (4, 2), (4, 3)}
d) {(1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 2),
(3, 0), (3, 3), (4, 0)} e) {(0, 1), (1, 0), (1, 1),
(1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2), (4,
1), (4, 3)} f) {(1, 2), (2, 1), (2, 2)}
2.
a) Transitive b) Reflexive, symmetric,
transitive c) Symmetric d) Antisymmetric e)
Reflexive, symmetric, antisymmetric,
transitive f) None of these properties
3.
a) Reflexive, transitive b) Symmetric c)
Symmetric d) Symmetric
4.
a) Symmetric b) Symmetric, transitive c)
Symmetric d) Reflexive, symmetric,
transitive e) Reflexive, transitive f)
Reflexive, symmetric, transitive g)
Antisymmetric h) Antisymmetric, transitive
5.
a) {(a, b) | a − b ≡ 0, 3, 4, 6, , 8, or 9 (mod
12)} b) {(a, b) | a ≡ b (mod 12)} c) {(a, b) | a
− b ≡ 3, 6, or 9 (mod 12)} d) {(a, b) | a − b ≡
4 or 8 (mod 12)} e) {(a, b) | a − b ≡ 3, 4, 6,
8, or 9 (mod 12)}
6.
◦R = {(a, b) | a is a parent of b and b has a
sibling}, R ◦ S = {(a, b) | a is an aunt or
uncle of b}
7.
a) Answer: This is True. Equality is a
reflexive relation.
b) Answer: This is False. Not equal is not a
reflexive relation.
c) Answer: This is False. Less than is not a
reflexive relation.
d) Answer: This is True. Greater than or
equal is a reflexive relation.
e) Answer: This is True. Divides is a
reflexive relation. (f) (∀X ∈ 2 U)(X ⊆ X).
8.
(a) The relation is reflexive: For every real
number x, x − x is the integer 0. (b) The
relation is symmetric: For all real numbers x
and y, if x − y is an integer, then y − x is an
integer. (c) The relation is transitive: For all
real numbers x, y, and z, if x − y is an
integer and y − z is an integer, then (x − y) +
(y − z) = x − z is an integer. This
equivalence has infinitely many equivalence
classes. For each x ∈ R, the equivalence
class for x is [x] = {x + k : k ∈ Z}

2. Type of Graph:

3. Type of Graph:

4. The intersection graph of a collection of

sets A1, A2,...,An is the graph that has a
vertex for each of these sets and has an edge
connecting the vertices representing two sets
if these sets have a nonempty intersection.
Construct the intersection graph of these
collections of sets.
a) A1 = {0, 2, 4, 6, 8}, A2 = {0, 1, 2, 3, 4},
A3 = {1, 3, 5, 7, 9}, A4 = {5, 6, 7, 8, 9}, A5
= {0, 1, 8, 9}
b) A1 = {..., −4, −3, −2, −1, 0}, A2 = {...,
−2, −1, 0, 1, 2,...}, A3 = {..., −6, −4, −2, 0,
2, 4, 6,...}, A4 = {..., −5, −3, −1, 1, 3, 5,...},
A5 = {..., −6, −3, 0, 3, 6,...}
c) A1 = {x | x < 0}, A2 = {x | −1 <x< 0}, A3
= {x | 0 <x< 1}, A4 = {x | −1 <x< 1}, A5 =
{x | x > −1}, A6 = R
5. find the number of vertices, the number of
Lesson 4: edges, and the degree of each vertex in the
1. Type of Graph: given undirected graph. Identify all isolated
and pendant vertices.
6. find the number of vertices, the number of
edges, and the degree of each vertex in the
given undirected graph. Identify all isolated
and pendant vertices.
7. determine the number of vertices and
edges and find the in-degree and out-degree
of each vertex for the given directed
multigraph.
8. determine the number of vertices and
edges and find the in-degree and out-degree
of each vertex for the given directed
multigraph.
9. determine whether the graph is bipartite.
You may find it useful to apply Theorem 4
and answer the question by determining
whether it is possible to assign either red or
blue to each vertex so that no two adjacent
vertices are assigned the same color
10. determine whether the graph is bipartite.
You may find it useful to apply Theorem 4
and answer the question by determining
whether it is possible to assign either red or
blue to each vertex so that no two adjacent
vertices are assigned the same color
11. use an adjacency list to represent the
given graph.
12. use an adjacency list to represent the
given graph.
13. Represent the graph in Exercise 11 with
an adjacency matrix.
14. Represent the graph in Exercise 12 with
an adjacency matrix.
15. Represent the given graph using an
adjacency matrix.
 19. determine whether the given pair of
graphs is isomorphic. Exhibit an
isomorphism or provide a rigorous argument
that none exists.

16. determine whether the given pair of

graphs is isomorphic. Exhibit an
isomorphism or provide a rigorous argument
that none exists.

20. Are the simple graphs with the following

adjacency matrices isomorphic?

17. determine whether the given pair of

graphs is isomorphic. Exhibit an
isomorphism or provide a rigorous argument
that none exists.

21. Does each of these lists of vertices form

18. determine whether the given pair of a path in the following graph? Which paths
graphs is isomorphic. Exhibit an are simple? Which are circuits? What are the
isomorphism or provide a rigorous argument lengths of those that are paths?
that none exists. a) a, e, b, c, b
b) a, e, a, d, b, c, a
c) e, b, a, d, b, e
d) c, b, d, a, e, c
22. Find the number of paths from a to e in
the directed graph in Exercise 2 of length
26. determine whether the directed graph
shown has an Euler circuit. Construct an
Euler circuit if one exists. If no Euler circuit
exists, determine whether the directed graph
has an Euler path. Construct an Euler path if
one exists

a) 2.
b) 3.
c) 4.
d) 5.
e) 6.
f) 7.
23. determine whether the given graph has 27.
an Euler circuit. Construct such a circuit
when one exists. If no Euler circuit exists,
determine whether the graph has an Euler
path and construct such a path if one exists.

28. determine whether the given graph has a

Hamilton circuit. If it does, find such a
circuit. If it does not, give an argument to
24.
show why no such circuit exists.

25. 29. Does the graph in Exercise 32 have a

Hamilton path? If so, find such a path. If it
does not, give an argument to show why no
such path exists.
30. find the length of a shortest path between Lesson 4 Answers
a and z in the given weighted graph. 1.
Simple Graph
2.
Pseudograph
3.
Directed graph
4.

5.
v = 6; e = 6; deg(a) = 2, deg(b) = 4, deg(c) =
1, deg(d) = 0, deg(e) = 2, deg(f ) = 3; c is
pendant; d is isolated.
6.
v = 9; e = 12; deg(a) = 3, deg(b) = 2, deg(c)
= 4, deg(d) = 0, deg(e) = 6, deg(f ) = 0;
deg(g) = 4; deg(h) = 2; deg(i) = 3; d and f
are isolated.
7.
v = 4; e = 7; deg−(a) = 3, deg−(b) = 1,
deg−(c) = 2, deg−(d) = 1, deg+(a) = 1,
deg+(b) = 2, deg+(c) = 1, deg+(d) = 3
8.
5 vertices, 13 edges; deg−(a) = 6, deg+(a) =
1, deg−(b) = 1, deg+(b) = 5, deg−(c) = 2,
deg+(c) = 5, deg−(d) = 4, deg+(d) = 2,
deg−(e) = 0, deg+(e) = 0
9. 19.
Bipartite Isomorphic
10. 20.
Not bipartite a) Yes b) No c) No
11. 21.
a) Path of length 4; not a circuit; not simple
b) Not a path c) Not a path d) Simple circuit
of length 5 3
22.
a) 1 b) 0 c) 2 d) 1 e) 5 f) 3
23.
Neither
24.
12. No Euler circuit; a, e, c, e, b, e, d, b, a, c, d
25.
a, b, c, d, c, e, d, b, e, a, e, a
26.
. Neither
27.
No Euler circuit; a, d, e, d, b, a, e, c, e, b, c,
b, e
28.
13. a, b, c, d, e, a is a Hamilton circuit.
29.
f, e, d, a, b, c is a Hamilton path.
30
16
14.

15.

16.
Isomorphic
17.
Isomorphic
18.
Not Isomorphic