Concordia University

COEN231: Introduction to Discrete Mathematics S2025

Assignment 3
Due date: Wednesday August 13.

1. Prove that n3 + 2n is divisible by 3 for all positive integers n.

2. Consider the following two sets:

A = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}
B = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}
Define the relation B = :* A" ") 9 "#/1#345#6578/2.56#,- #345#./0/1/,2#,- #*+A + %)#'(#$%&#A ! #" " ! !!
Is the relation R a function? (show your reasoning)
Is it Bijective? (show your reasoning)
Find the composite relation 𝑅 ∘ 𝑅.

3. A relation R on A ={1,2,3,4,5,6,7,8,9,10} is defined by aRb if and if “a-b” has either 2 or 3 as

divisor.
Is the relation R, Reflexive, Symmetric, Transitive?

4. Consider the following relations on the set of real numbers:

R1 = {(a, b) | a > b}
R2 = {(a, b) | a ³ b}
R3 = {(a, b) | a < b}
R4 = {(a, b) | a £ b}
R5 = {(a, b) | a = b}
R6 = {(a, b) | a ¹ b}
Find:
R1 È R3 , R2 Ç R4 , R3 Ç R5 , R2 – R1 , R1° R6 , R1° R5

5. Consider the following relations on the set of all positive integers:

R1 = {(a, b) | a divides b}
R2 = {(a, b) | a is a multiple of b}

Find: R1 È R2 , R1 Ç R2

6. Let R be the relation on the set of ordered pairs of positive integers such that ((a, b), (c, d)) Î
R if and only if ad = bc. Show that R is an equivalence relation.

7. A relation | is defined on A = {1, 2, 4, 6, 9, 12, 18, 36} by a|b if and only if a divides b.
a- Show that the relation | is a partial ordering (NOTE: you must clearly show your
reasoning)
 2,3 3 tanceship graph, 52. Letwhere G be vertices
a graph with represent all theand
v vertices people
e edges. Let M be
3. For
ordegree
17.each which
What of do values
the 17.
thegraphsof ninare
What
in-degree these
do and
the thegraphs
in-degree
out-degree regular?
and the out-degree in aof aof vertex in a
38. What is the of a vertex
degree sequence the bipartite graph Km,n in the world? What does the neighborhood
the maximum degree of theavertices vertex inofthis G, and let m be
a) directed
Kn b) directed
graph Cmodeling
n grapha modeling
c)round-robin
W n
where m
atournament
d)round-robin
and nQ aren positive rep-tournament rep-
integers? Explain your answer. graph represent? the What
minimum do isolated
degree and
of thependant
vertices vertices
of G. Show that
f
resent? e d
f each
4. For of the
which
resent? valuesfollowing
of m and n is K regular? in this graph represent? In one study it was estimated that
arty, of 39. What
m,n is the degree sequence of K n , where n is a positive a) 2e/v ≥ m. b) 2e/v ≤ M.
18. Show that 18.in2.Show
a simple athatgraph
in a simple
withb atgraph least withvertices
two at least two vertices the average
5.
with,How is many vertices
there
does a regular
must bethat
integer?
twohave
graph
vertices
c
Explain
of degree
that have
your
fouranswer.
d the same degree. A degree
simple of a vertex
graph in this
is called graph is
regular if 1000.
every What
vertex of this graph
hand. there
c)
with 10 edges must
W be
4 have? two vertices the same degree.
40. How many edges does a graph have if its degree sequence does this mean in same
terms degree.
of the model?
19. Use Exercise 18 to show that in a group of people, there has the A regular graph is called n-regular if
19. Use Exercise
dExercises
edges 56–58 find 18 the to show
union that
of52.in
is 4,
the aLet
group
3, G
given 2,of2?
be
3,pair apeople,
ofgraph
Draw
simple there
with
such va vertices
graph. and e edges. Let 13. M What be doesevery the degree
vertexofina this
vertex represent
graph has degreein an academic
n.
ofaphs.
the must
bipartitebe two
graph must
people
K be
who twoarepeople
friends who
thewith arethe
maximum friends
same with 666
number
degree theof same
10
the numberof G, and let collaboration
/ vertices
Graphs m be graph? What does the neighborhood of a
for the (Assume edgesofwith
of otheryour
gers? Explain people
m,n
inother
answer.
theb-
same41.Construct
How manyare
endpoints
people in the
the group. the2,group.
its
minimum
edgesHasse
the does adiagram
same.)
degree
graph have if its degree sequence
of thea vertices of G. Show thatvertex represent? 53. ForWhat whichdo values
isolatedof nandare pendant
these graphs regular?
vertices
is 5, 2, 2, 2, 1? Draw such graph.
6. 20. Draw
a
these 20. Draw
graphs. c-
these List
graphs. all minimal andc maximal elements (if any)represent? a) K b) C c) W d) Qn
f Kn , where n is a positive d1 , d≥ b) 2e/vif≤it M.
a) 2e/v m. n n n
e A sequenced b) K 2 , . . . , dn 23.is called graphic is
c the degree
a) K7 a) K b)
7 d-
f K1,8 Indicate
A simple
sequence b the
ac)simple
1,8
ofWgraph least/greatest
K4,4is called
c)
graph.fregular
K 4,4 elements
b (if any)
if every vertex of this graph 14. What does 54.
the For
degree which
of avalues
vertex of
in mtheand c)n is
HollywoodIs K
the matching
m,n regular?
graph of responsib
f b
3.d) C e) ) Q (b) a complete
repre-of degree fourIs
matching?
have ifd)itsCdegree
7 sequence 7e) W7a
42.has theb same
Determine
f7) Q c4
degree.
whether d of 4these
A regular
each graph is calledisn-regular
sequences graphic. represent?
if What
55. How doesmanythe neighborhood
vertices does of a vertexgraph
a regular
In Exercises
raph.In Exercises 21–25 8. How21–25
determine many determine
whether
every
Forvertices
the graph
vertex
those
whether
and
in
that this
are,
the graph degree
is edges
bipartite.
graph
draw ahas does:
graph
a
is bipartite.
a)n.K the have?
having
and answer the100
givenddegreeb) sent?
C55 Whathave? do the
W
with isolated
90 10 have?
edgesandhave?
Kpendant
10, 16 have?
29.vertices
Suppose represent?
that there are five youn
You
have e ifmay findYou
its degree may find
itsequence
useful it useful
to apply Theorem to apply 4 andTheorem
answer 4the 15. What do the in-degree and the out-degree of
men a vertex
on angivenin a pair
island. Each man is w
question by determining
graph.
9.
c
Determine
question bywhether determining whether
sequence.
53. For which each
whethertoitassign
it is possible
values of
is possibleofthen following
are these
eitherto assign either
graphs graphs
regular? is bipartite or
telephone graphs.
In not:
Exercises 56–58 find the union of the
call graph, as described in Example 4 of Sec-
of simple
a) a)5,so 4, (Assume edges with the the
same women
endpointson the
areisland
the and e
same.)
red or blue red orvertex
blue to each vertex n3, 2,no
Kthat 1, two
0b)b) Cn6,
adjacent 5, 4, 3,c)
are3, 2,vertices
2, 1Wnc) 2, 2,d)
f 2, 2 are
2, 2,
Q2, 2
n tion 10.1, represent? What does the degree of aanyvertex inwho is willing to
graphic if dittoiseach
the degree so that nod)two
di color. 3, adjacent
3, 3, 2, 2, vertices
2 e) 3, 2, f ) 1, e1, 1, 1, 1, 1 56. version of a
marry man
assigned the same assigned f the same
color. 54. For h which values g of m e and n is K regular? the undirected this graph represent? Sandeep is willing to marry Tin
g) 5, 3, 3, 3, 3, 3 h) 24. 5, 5,a 4, 3, 2, 1m,n b
7. 21.a b
21. 4. a
a Find the sum f of
b22.
55.b theHow degrees
many 22. of the
vertices vertices
b does of a eachc graph
regular graph of 16.
degree What
four do the in-degree and the out-degree of a vertex
willing to in Tina, Xia, and
a
hese sequences is graphic. b b c
43. Determine whether each of these sequences is graphic. f b marry
in Exercises 1–3 and
with verify
10 that
edges it equals
have? twice the number the Web graph, f described in Example
as b 5 of
marrySection
Tina 10.1,
and Zelda; Anil is w
ph having the given degree For those that are, draw a graph having the given degree
of edges in the In graph.
Exercises 56–58 find the union off the given pair of represent?
simplec and Zelda; and Emilio is willing
e e e e sequence.
a a d
graphs. (Assume edges with d the same endpoints are 17.same.)
the What do the in-degree and the out-degree of aHall’s
Use vertextheorem
in a to show the
3, 2, 1 c) 2, 2, 2, 2, 2, 2 5. Can a simple graph exist
a) 3, 3, 3, 3, 2 with 15 vertices each
b) 5, 4, 3, 2, 1 of degree e
c) 4, 4, 3, 2, 1 directed graph modeling a round-robin tournament c
2, 2, 2 f ) 1, 1, 1, 1,five? 1, 1 young men rep-
and young women on
d) 4, 4, 3, 3,
56. a 3 e) 3, 2, 2, 1, 0 f ) 1, 1, 1, 1, 1
3, 2,c 1c d 6. c g∗ 44. d e resent? young man is matched with a yo
d c Show that d sum,
the Suppose overthat theedset
1 , dof . . , dne isataagraphic
2 , .people party, of sequence.18. Show d d
hese f bb Show that in a simple graph with at least to dmarry.
two vertices
8. a sequences isb graphic. a number ofe people
the thatf there is a simple
a person hasbshaken25.
graphhands with vertices
with, is v1 , v2 , . . . , vthere
ph having the given degree
n must57. be twoa vertices that b have a the same f
30. Suppose
b
degree.
that there are five youn
even. Assume that suchno thatonedeg(vshakes i ) =his di orforher i =own 1, 2,hand.. . . , n and v1 is adja-
19. Use Exercise 18 to show that in a group men of people, there Each woman
on an island.
In Exercises 7–9 determine cent to v2the . , vd1 +1of
, . .number . vertices a and edges c
h∗ e c must be two people who are friends with the same
of the number
2, 1 c) 4, 4, and 3, 2,find1 the in-degree 45. Show andthat a sequence
out-degree 1 , d2 ,vertex
of deach . . . , dnfor ofthenonnegative inte- e e men on the island and eac
1, 0 f ) 1, 1, given 1, 1, 1directed multigraph. of other people in the group. any woman who is willing to m
gers in nonincreasing order is a graphic sequence if and
20. Draw these graphs. Anna is willing to marry Jason,
a graphic sequence. Show only if the dsequence obtained dby reordering the terms
c d f g
with vertices v1 , v2 ,7.. . . , vn of
57. b the 8.
a sequence dba2 − 1,a. . .f,bddf1 +1 − b1, dd1 +2 , . . d. , dn so
a) K7 c b) K1,8 d c c)isgK willing
4,4 d to marry Kevin and L
9.1,The complementary graph G of a simple graph G has d) C 7 e) W 7 f ) Q
marry 4 eJason, Nick, and Oscar; D
2, . . . , n and v1 is adja- a that the terms are in nonincreasing order is a graphic 58. a b a
the same vertices10. as G. Two vertices
Let graphsequence. are adjacent in G if
G’ be the complement graph eof a simple graph G such that: 1) G’ and G have isthe In Exercises 21–25 determine whether the Jason,
graph Larry, Nick, and Oscar; a
bipartite.
. . ,and
dn ofonly if they areinte-
nonnegative not adjacent
same number ∗ 46. Use in G. Describe
of Exercise
vertices45and e each of
2)26.two
to construct Foravertices
e
recursive
which areofadjacent
algorithm
values
You
n are
may
de-ingraphs
forthese find it
G’determining
useful
ifbipartite?
and only
to apply
if they
Theorem
are notto
4 marry
and Jason
answer and
the Matt.
these graphs.
a graphic sequence if and termining whether a nonincreasing question by whether it is possible h assign either
a) Model the possible marriag
a) reordering
Kn b)adjacent
Km,n inc)G. Cintegers d) Qn a) Kn sequence b) Cnof positive
red orc)blue Wnto each vertex d) Qnso that no two adjacentbipartite vertices graph.
are
d by the termsd
n
c is graphic. d c
d0.
1 +1If −G 1,
is dadsimple . , dn so
1 +2 , . . graph
1)Find
with 1547. edges
Show the
c
andthatcomplement
G has every d
13 edges,
27.
c of :
Supposeg that
nonincreasing sequence of nonnegatived there are four
assigned employees
the same in the
color. computer b) Find a matching of the youn
9. a b support group of the School21. a of Engineering b c of a large22. d f b meng con the island such tha
easing order is a graphic 58. a
how many vertices does G have? integers with an even sum of its terms is the degree se- b a e
university. Each employee will be assigned 59. Thetocomplementary
support graph G of a simple
matched with graph
a young G has
man
quence of a pseudograph, that is, an undirected graph
one of four different areas: hardware, software, the network-
same vertices as G. Two vertices
marry. are adjacent in G if
recursive algorithm for de- where loops are allowed. [Hint: Construct such a graph
ing, andh wireless. Suppose that Ping ise qualified and to support
only if they are a not adjacent c) Is the in G. d
Describe
matching youeach of
found
asing sequence of positive by first adding as many loops as possible at each vertex.
hardware, networking, and wireless; Quiggley theseis qualified
graphs. matching? Is it a maximum
Then add additional edges connecting vertices of odd
to support software and networking; Ruiz is qualified to b) K
g sequence of nonnegative
d
degree.cc
Explain dwhy this
e
construction
f support networking g
works.]
and wireless,c and Sitea d a) Kn
is qualified to ∗ 31. Suppose
m,n ec) Cn there is d) Qn
an integer ks
its terms is the degree se- 48. How many subgraphs with at least one vertex does K 2 60. If G is a simple graph with 15
desert edges
islandand isG has
willing 13 edges,
to marry
at is, an undirected graph 2) If 59. ahave?
graph G has 15 edges and its
of acomplement Ghas has 13 edges. howHow many vertices does
The complementary support
graph Ghardware simpleandgraph
software.
many vertices does Gon have?
the island and every woman o
nt: Construct such aGgraph have? the same vertices as G. a)Two Use a bipartite
vertices are graph
adjacent to model
in G ifthe four employees and
their qualifications. marry exactly k of the men. Als
as possible at each vertex. 3) Find and only if they are not adjacent
the complement ofb)CUse
in G. Describe each of
6. Hall’s theorem to determine whether there is an willing to marry a woman if and
onnecting vertices of odd these graphs.
truction works.]
4) If G has a) K5n vertices b) and Km,n4 edges. c) CHow
assignment n
many d) Qedges
of employees n
doesareas
to support G’ have?
so that each Draw both Gmarry and him.G’ Show that it is possib
! women on the island so that ev
least one vertex does K2 Hint: 60.𝑮If∪G𝑮is a is a complete
graph withgraph
employee is assigned one area to support.
simple 15 edges and G has 13 edges, someone that they are willing to
c) If an assignment of employees to support areas so that
how many vertices does G have? ∗ 32. In this exercise we prove a th
each employee is assigned to one support area exists,
11. Represent the following graphs using find one. their adjacency matrices: K5, K2,3, C5 Suppose that G = (V , E) is a bi
12. Use an incidence matrix to28. represent
Suppose that a directed
a new company cyclehas Cfive
5, direction
employees:isZamora, clock wise. tition (V1 , V2 ) and that A ⊆ V1 .
13. Determine whether these graphs are or are
Agraharam, Smith,notChou,isomorphic:
and Macintyre. Each employee number of vertices of V1 that
will assume one of six responsiblities: planning, public- matching of G equals |V1 | −
ity, sales, marketing, development, and industry relations. def(A) = |A| − |N (A)|. (Here,
Each employee is capable of doing one or more of these ficiency of A.) [Hint: Form a
jobs: Zamora could do planning, sales, marketing, or in- maxA⊆V1 def(A) new vertices t
dustry relations; Agraharam could do planning or devel- them to the vertices of V1 .]
opment; Smith could do publicity, sales, or industry re- 33. For the graph G in Exercise 1 fi
lations; Chou could do planning, sales, or industry rela-
1) tions; and Macintyre could do planning, publicity, sales,
a) the subgraph induced by the
b) the new graph G1 obtained fr
or industry relations.
edge connecting b and f .
a) Model the capabilities of these employees using a bi-
partite graph. 34. Let n be a positive integer. Show
b) Find an assignment of responsibilites such that each by a nonempty subset of the vert
employee is assigned one responsibility. graph.
 f e d c) a b c d e
What is the sum of the entries in a column of the incidence
atrix for an undirected graph? v6
b
u5 u3
nd an adjacency matrix for each of these graphs.
c v4 v3
Kn b) Cn c) Wn d) Km,n e) Qn u4 10.3 Representing Graphs and Graph I
nd incidence matrices for the graphs in parts (a)–(d) of i h g f
xercise 32. Suppose
40. u 1 Gu 2= (V
41. that u 3, E) is
u 5 a directed
v1u 6 v2 A vertex w ∈ V
u graph.
8 has the form
rcises 34–44d determine whether the given pair of graphs is reachable
u1 u2 a vertex v ∈ V if there is a directed path
from
e Exhibit an isomorphism or provide a rigorous
morphic. ! "
22.The
from v to w. Usevertices
paths either
v andtowshow that these reachable
are mutually graphs are not
if isomor- 0 Find
34. A all the cut edges in
ent that none exists. ,
there are both phic oru 4to find
a directed pathan isomorphism
from v to w and between
a them.
directed path B 0
b c u7 ∗ 35. Suppose that v is an en
v1 v2 from w to vu6in G. v6 v3
u3
u1 u2 v1 v2 is entries
where the four a cut vertex
shownifare
and on
recta
1 u2 u3 u4 u5 v3 v1 v2 v4 v5 v6 v8
g d 16. Show that if G = (V , E) is a directed graph and u, v, and A simple graph is called self-compleme
∗ 36.GShow that a vertex c in
v4 v5 u8 in V for whichuu3 and vv8 are mutually reach-
v3 are isomorphic.
uw
5 are vertices
u4 v5 v4 a cut vertex if and only
e able and v and w are mutually reachable, then u and w 50. Show that this graph is self-compleme
different from c, such
v v7
2) u73 reachable.
are mutually u4 v7 v4
a passes
b through c.
42. u6 u7
o the strongly connected components of a tele-
17. Show that if G u=6 (V , E)
u5 is a directed graph,
v6 v5
then the ∗ 37. Show that a simple grap
all graph represent?
strong
u components
u of
Gu two vertices
u uu and v of H
V are either least two vertices that a
1 2 3 4 5
the same
23. orUse disjoint.
paths either[Hint:toUse show Exercise
that these16.]graphs are not isomor-
strongly connected components of each of these ∗ 38. Show that an edge in a
phic or to find an isomorphism between them. d c
18. Show that all vertices visited in a directed path connecting only if this edge is not
b c 51. Find a self-complementary
graph. simple gra
two verticesuin 8 uthe
1 same
u 9 u strongly
u2 10 connected v 1 component
tices.
of a directed u6 v graph uare also in this strongly connected
7 v7 v6 ∗ 52. Show that39.ifAGcommunications
is a self-complementlink
component. 6 v5
v4 v2 with
with v vertices, then v ≡ 0 or link
a backup if it4
1 (mod
v7
19. Find vthe number v2 u8of vpaths uof
some message to be
53. For which integers n is Cn self-comple sen
3 length v5n between
1 3 v4 v8 two differ-
ent vertices in K4 if n is networks shown
54. How many nonisomorphic simple grap here in
d u5 u4 v3 that should be backed u
a) 2. b) 3. c) 4. d) 5. vertices, when n is
b c G H a) 2? a) b) 3?
24. Find v8 the number
v9 vof
10 paths of length n between any two ad- 55. How many nonisomorphic simple gra
3) 20. Use
43. paths either
jacent to show that these graphsv 2are not
u 2vertices in K3,3 for the values ofisomor-
n in Exercise 19. five verticesSan
andFrancisco
three edges?
phic or25.to Find
find an theisomorphism
number of paths between these graphs.
of length n between any two56. How many nonisomorphic simpleDenve gra
nonadjacent
u9 vertices in v1 K vfor 8
v 3 of n in Exer- six vertices and four edges?
the values
u1 u 1 3,3
u 10 u2 u u v3 1 v2
cise 19. 8 v 10 57. Are the simple Los Angeles
graphs with the followi
e d
u26.
5 u6Find the number v5 v6between c and d in the graph in trices isomorphic?
of paths
u7 v6 v7 v9 v ⎡ b)⎤ ⎡ ⎤
Figureu 6 1 of length
4 1
a) 0 0 1 0 1 1
⎣ Seattle
⎦ ⎣ Portland
⎦
b c d e u8 uu7a)
u 4 3. v8 4.v7 0 0 1 , 1 0 0
5 2.
b) c) d)v 55. e) 6. f) 7.
1 1 0 1 0 0
22. Useu4 paths
27.either
Finduto show that these graphsvare
3u1 numberv4of paths from
the 3a to
not isomor- 34. Find ⎡ all the cut edges ⎤ ⎡in the graphs
44. v1 e in the directed graph b) San Denver C
phic or toGfind an isomorphism between them. 0 1 0 1 0 1 1 1
4) u 8
in Exercise 2 of
u2
length H v 8 v2 ∗ ⎢
35. Suppose
⎢1 0that0v is1⎥
Francisco
⎥ ⎢
an endpoint
⎢1 0 of 0 a1
u1 a) u2. b) 3. vc) 4. v2 d) 5. e) 6. f) 7. is a⎣cut
0 vertex
0 0 if 1and ⎦,⎣ 1 if0 this
only 0 veK1
21. Use paths either to show that these graphs are not isomor-
2 1
1 1 1 0 Salt1Lake1 1 0
h g f phic∗uor 7 to Show
28. find anthat isomorphism
everyu 3connectedvbetween
7 graphthem. with n vertices
v3 ∗ 36.
has at Show ⎡ that a vertex
Los ⎤City c⎡in the connec
u8 u3 v8 v3 c) 0 1 Angeles
1 0 0 1 0 1
least n − 1 edges. a cut
u1 u2 v1 v2 ⎢
⎢ 1 0 0 1⎥ , ⎢1if there
vertex if and ⎥only
⎢ 0 0are0
strongly connected components of each of these 29. u Let G = (V , E)
u be a simple graph. Let Rv be the relation different
⎣1 A0from such that every
v6 c, ⎦ ⎣ 0 p
6 4 4
u7 u4 v7 v4 0 1basis 0in a0 directe
vertex 1
on V uconsisting of pairs of vertices v (u, v) such that there passes 0 through
1 1 c.0 1 0 1for 0e
u8 5 u3 v8
is a path from u to v or such that u = v. Show that R is
5 v3 vertices of G such that
b c 58. Determine is awhether to the graphs withou
u6
45. Show an
u5
thatequivalence
isomorphismrelation.
v6
of simple
v5
graphs is an equiva- ∗ 37. Show that apath
simple vgraph
from some
with atver
le
u7 ∗ u v v incidence matrices are isomorphic.
lence G relation. 4 7 H 4
30. Show that in every simple graph there is a path from every a) 1 40. least⎡ two ⎤
vertices ⎡ that are ⎤
not cut v
0 Find
1 a vertex
1 1 basis 0 for e
23. Use paths either
vertex to show
of odd that these
degree to graphs
some are
other not isomor-
vertex of odd degree. ⎣0 1 ercises
14. How many non-isomorphicphic 46. Suppose
simple that
u5 G and H are isomorphic v5 simple graphs. ∗ 38. Show that an1⎦ , ⎣17–9
in a0of Section
1⎦ grap 1
tou6graphs
orShow find
thatan their
are
isomorphismthere with
complementary
v6 3 vertices?
between graphsthem.
G and H are also 1 1 0
edge
0 1
simple
1
e In
d 15. Consider the following graph: isomorphic. Exercises
G 31–33 find all the H cut vertices of the given graph. only ⎡ if 41.
this What
edge is not part
⎡ of any
is the⎤ significance
u1 31. a u2 d e v1 32. a f graph.
b) 1 1 graph 0 0 (described
0 0 1 0
47. Describe the row and column of an adjacency matrix of ⎢1 0 1 0 1⎥ ⎢0 in1 Ex1
u6 u ⎢ vertex ⎥ ,in
basis ⎢ the influ
a graph 7 corresponding to an isolated v vertex. 6 ⎣
39. A communications 0 0 ⎦ in
link ⎣ a networ
0 1 1 1 0 0
v5
48. Describe the row ofvan with 0a backup
v2 of a graph cor-
4 incidence matrix 42. 1 link
1 Show if0 its
1 that if afailure
1 0 ma
connecte 1
v7
urespondingu to an isolated vertex.
v b e59.
c some message
Extend
d the theto beof
definition
graphssent. For each
isomorphism
G and G oo
,
1 2
8 b 3 c f8 networks shown
undirected graphs here in (a) loops
containing and (b),
an
49. Show that the vertices of a bipartite graph with two or common vertex.
f
Find the number of paths of length
u5
more2,vertices
33. u
3 andcan
4a 4 bbe
between
ordered so3vertices
v
a andmatrix
that its adjacency d. that should
60. Define be backed
isomorphism up.
of directed graph
∗ 43. Show that if a simple g
16. For which values of m and n does the complete bipartite graph contain a Euler circuit?
G H a)
24. Find the number of paths of nents and these compon
17. For which values of n does the complete graph Klength n between any two ad-
n contain a Euler circuit? respectively,
Chicag
then the nu
jacent vertices in K3,3 for the values
e of n in Exercise 19.
18. Which of these graphs below contain a Euler c circuit/Euler path?
25. Find the number of paths of length n between any two
g San Francisco
ceed
Denver
nonadjacent vertices in K3,3 for the values of n in Exer- ! k
cise 19. Los Angeles C(ni , 2).
26. Find the number of paths d between i c and dh in the graph in i=1
b)
Figure 1 of length Burlingto
Seattle Portland
a) 2. b) 3. c) 4. d) 5. e) 6. f) 7.
27. Find the number of paths from a to e in the directed graph San Denver Chicago
in Exercise 2 of length Francisco
 f ∗n tices. jSalt Lake Atlanta
∗ 28. bShow that29. every connected dIn Exercisesj with 31–33
28. find
Show allfthat
theat cut vertices
every to liftofa)
d
connected thegraph
given graph.
with so, n vertices
find such41. has at Ifis itthe
a path. does not,
Los give anaargument a gra
to
27. For which values Find of then doleastthegraph
number
graphs vertices
jinofExercise
times it26 ishas necessary
have aLosC City
where n ≥ 3 What significance Cityof vertex basis in
g least
an
b n
Euler − 1
path edges.
pencil
but no from
Euler 31.
the apaper
circuit? when d least
drawing en −each1 edges.
32.
of a
the graphs Angeles n show
f whyEXAMPLE no suchgraph path 9 exists.
Is
(described Angeles
the Petersen
in Example graph,
2 of shown
62. Use
Section in1
b) n where LetnR≥be 3 the relation f
j g d W
29. Let Ga= (V a , E) be a simple
in Exercises g 1–7
ggraph.
29.beLet
Let retracing
without R theG = part
relation
any (V , E) of thebe agraph.
simple graph. vertex basis in
studiedthe influence
this graph graph
in in that
is coex
28. For A vertex basis
c) vertices
Km,n 38. in Does
where av)m e
≥the
directed 2thatgraph
and n≥
graph inG 2Exercise A 31
is a minimal vertex
have setbasis
a BHamilton path? Ifgrapi
ofin a directed1891; it
on Vwhich valuesof
consisting ofpairs
m and does the
of nvertices (u,complete
v) such bipartite
on that
V consisting
there of pairs of (u, such there conn
h Inhave
Exercises u to vvertices ofthatG such so,
u = nv.that ≥ find such
2for each a path.
that42.Rvertex
is v that If it vertices
does
of Gif not not, of give
G such
an that
argument
in B theresimple graph for each
toG isv
i
i h graph eKm,n
is a path from to v or30–36
u an such that determine
u = v.whether
Showis athat the Rgiven
path is graph
from has a Q
d)
or such n where Show Show a connected
uses be connected toa) two e
utilities without
Hamilton i con- If it does,
circuit. h 7. find such a circuit.
a e equivalence
b is
Ifi itrelation.
bdoes a path
not, to v
a from show
some why
vertex
eb h the graphs the no such
B. path
graphs G48 isSolution:
exists. a path to vThe
from subgraph
some H
vertex
63. Show of
B.
an Euler circuit?
equivalence relation. i h c an 8.
i 49. Show
c gh dthat
h each of in i Exercise 1 andhasGno 2 , then
cut G1 and G2 have
c b fe that have b as an endpoint, has sh n
ossing?
d ∗ 30.c b) Euler give
thatpath? an argument to show why ∗ no such circuit inexists. edges. common vertex.
Show in every simple 33. graph a there is ab30. path Show
from fthat
every every simple 40. Does
37. graph
Find athethere39.isbasis
vertex
graph ainpath
Does the
for from
Exercise graph
each every
ofin
30 the Exercise
have directed 40. 32
{f,
a Hamilton have
Find
graphs
d, j aand
ain
}
path? Hamilton
vertex
Ex-
If {e,basis
i, path?
h}, If o
forbecaus
each
–4 draw the given planar vertex graph
of oddwithout anysome other vertex ofvertex of odd degree50. to someh other vertex of c 10.2.
odd 64.10.2.
In an
degree to odd degree. ercises
For
so, find each7–9
such ofaso, Section
path.find
these it∗degree.
Ifsuch
graphs,43.a path.
does findIf
not,
Show it does
κ(G),
give
that an not, give
ercises
λ(G),
if aargument
simple
deleting {d,
7–9
and
toanofargument
graph
h} and
Section
G has to
k conne
adding {c,
(a) 29. Find the least 30. number of H times it is necessary tod lift a(c) cK(c)
(a) a (b) H(b)
inequal- have n1 , n2farm
f 3,3 K
In Exercises 31–33 ofIntheExercises 31–33 find all themin 3,3 show
gcutv∈V why deg(v),
vertices no of show
such andpath
the why
determine
d exists.
given no such
graph. nents path
whichand exists.
of these
the two components
pencil from thefindpaper all when
the cutdrawing
verticeseach ofgiven graph.
the graphs 41. What is the significance of a vertex basis deleting
41.in What
an {i,the
is
influence j } significance
and addingaof ,{g,
. .a.v
rive
in
a Exercises d 1–7 without retracing a anyHpart ofa thee graph. ities inaκ(G) ≤ λ(G) ≤ minfv∈V deg(v) are then
respectively, strict.the number of edges of G
RE
GURE 14 14 (a) The
(a)31. Petersen
The Petersen Graph, Graph, (b)
e a Subgraph
(b)c 32.a Subgraph Homeomorphic
31.
cf H Homeomorphic
fd tog K e 3,3 , graph
38.
to KDoesand 32.the(c) K
40.
(described
graph3,3Does. in inExercise
the
Examplegraph 2inhave
31ceed ofExercise
Section
a Hamilton 33 have
graph
10.1)? a(described
Find
path? Hamilton
Ifa path?
in If
Example
the fa
3. 3,3 , and (c) K 3,3 .
e d vertex
a)
so, finda basis
f such in
a so,
e the
path.find If such
influencec does
it agraph
path.
not, If
in it does
that
give an not, give
vertex
example.
argument basis
toaninargument
the to
influence
He ca g
In Exercises 30–36 determine whether the given graph has a
Hamilton circuit. IfinitFigure
does, find suchplanar? 9.
a circuit. If itDanish
does not, a show why no show
such Exercises
if baPetersen
why
path no
exists.such path exists.
! k is on
E 9Is the IsPetersen
the Petersen
give
graph,
an in
shown
graph,
argument shown
tois in Figure 14(a),
no14(a), planar? (The (The
i Danish mathematician 42. Show
mathematician
b
Julius that Petersen
Julius
∗
connected simple graph G42. Show
isC(n
the union
i , 2).
thatof if a connectedlarly, simp
studied this graph 1891; it bshow
often why used such
to circuit
billustrate c exists.
various
d e theoretical
e properties
39. the
Does of
graphsb
the 41.
graphs.)
graph Does
cand
G1graphs.)in Gthe graph
d2 , then
Exercise 32eGin Exercise
and
1have a have
GHamilton
2i=1 34thehave a Hamilton
graphs
at least
path? one
If G1 andpath? If
G2 , then G
studied this bgraph in c1891; it is f often used to illustrate
d b various
i c theoretical
h f properties of state
common
so, finde vertex.
such a so, path.
1.find If
Can such
it
d a
does
five path.
not,
houses If
give
be it does
an
connected not,
common
argument give
to two toan argument
vertex.
utilities to
withoutuse thco
33. aa f f
30. b a
31. b d h 33. 32. aa by deleting b b
showpath why no such path exists.
Solution:
Solution:The subgraph
The subgraph H ofH the of Petersen
the Petersen graph graphobtained
obtained by deleting b∗ 43.andbshowthe
and why noedges
three
the three such
edges nections
Show that ifba simple graph Gd has k connected
exists. crossing? ∗ 43. Showcompo- that if a simple graph G goat
that that
havehave
b asbanasendpoint, shown in11.1
FigureIntroduction
14(b), to homeomorphic
gis Trees 755 to Kto b)
, nents
with vertex sets In Exercises 2–4 on th
an endpoint,c
shown f
in Figure 14(b), is homeomorphic 40.
cK
3,3 3,3 , with
Does and
the 42.vertex
these
graph Does sets
the graph
components
in Exercise have
33 inhavendraw
Exercise the. given
2 , . .35
1 ,anHamilton have planar
a Hamilton
nk vertices,
,nents and
path? these
If
graph without
path?
components If ha
{f, d, j } and {e, i, h}, because
{f, d, j } and {e, i, h}, because it can be obtained c by a sequence of elementary asubdivisions, aso,
crossings.
c find
theIfgnumber
such a path. eIf itofdoes not, notgiveex-toan then
argument is
to on
e it can be obtained by a sequence c of eelementary respectively,
so, find subdivisions,
such then path. it does ofnot,edgesgive does
respectively,
Gargument
an the number
deleting {d, h}
deleting {d, and
h} adding
and
c {c, h} and {c, d},g deleting {e, f } andc adding {a, e}ceed
adding {c, h} and {c, d}, deleting f {e, f } and adding
d {a, and
show e} {a,
g f }, and
and
why {a,
no show
such
f }, why
and
path no
exists.such path exists. ceed a) F
r h − 1, and because the height is h, there is at least one leaf at level h.
{i, } {g, {g, }.

▲
deleting j and adding i} and j Hence, the Petersen graph is not planar. 2. 3. th
mh−1{i,leavesjb} and(see {g, i}30). {g, j }. eHence, e

▲
deleting adding andBecause mh ,the Petersen graph is not planar.
more than Exercise 10.l ≤ we have k h Does the graph in
e d Complete d the argument e in ∗ 41. f Does the
Example 3. ! 43.
graph in Exercise 34 fhave Exercise
a Hamilton 36 have path? ! k
a Hamilton
If path? If le
garithms to the base m in this inequality gives h − 1 < logm l ≤ h. a aso,
C(n i , 2). it does
bfindIfsuch not, givetoanC(n i , 2). to
11. Show that K5 is nonplanar using so, anfind such
c) h argument
path.
similar to a d) path.
not, If giveitadoes
an argument argument b) C
31. a d b i a 32. ha b b g d i show why i=1
no show
such why
path no
exists.such path exists. i=1
33. that given in Example 3. re
9 determine whether the given graph is planar.
that no edges cross.19. Which of these graphs below are planar? 12. Suppose that a connected planar c
graph
42. Does the graph has deight
44. For e vertices,
in which
f
Exercise values
35 have b
of n adoHamilton c
the graphs path?in Exercise
If 26 have se
c each of degree three. Into howso, many regions
find such a path. ais the
Hamilton plane circuit?
If it does not, give an argument to if
esconnected
be connected to two to utilities without
two utilities withoutcon-con- 7. 7. cadivided a b by ba planar representation8. 8. a gof a whyb graph?
this hb such i 4.pathj exists. in
6. a b c show no d e f
?sing? 45. For which values of m and n does the complete bipartite c) E
13. Suppose that a connected planar graph has six vertices,
wdraw
the given
the givenplanarplanargraph
e graph without d any
without e any c d d each of e fdegreef four. Into h how43.h Does
many the regionsk cgraph
graph isinthe Km,n have
l cExercise
plane 36 have a Hamilton
a Hamilton circuit? path? If in
c f f divided by a c
planar c representation so, find
of such
this a path. If it does not, give an argument to
graph? so
a) Which vertex is the root? g 51. Showwhy
g show that no if G dsuch is adpath
connected graph, then it is possible to
33.b) Which vertices a b g 14. Suppose that a connected planar graph vertices
has 30 edges. exists.
If a d) F
are internal? remove11.1 Introduction to disconnect
to Trees G 755 if and only if G is not a
3. 3. c) Which vertices are leaves? planar representation of this 44. graph
For divides
which the
values plane
of n into
do the graphs in Exercise 26 have se
d e f complete graph.
f d) Which vertices are children of j ? e20 regions, e d dhow many verticesf doesf this e graph
a Hamilton circuit? e have? e) S
e)ThenWhich vertex 9. a 52. Show that if G isIna Exercises connected5–9 graph with n vertices
determine whether then
the given graph is plan
each leaf is is the
at levelparent of h
h or h?9.− 1, and because a
the height is h, there is at least one leaf at level h. w
f )It Which vertices are siblings i i b b 45. For which=values
a) κ(G) n −If1of if and h ,only
and if that
does Gthe=noK n.
complete bipartite
20. Suppose
follows that therethat a
must beofmore
connected o? than
bipartite
mh−1 leavesplanar simple
(see Exercise graph 30). has
Because e edges ≤mand
l so, mdraw n so
it
v
we vertices.
have edges cross. so
g) eWhich vertices are ancestors off m? graph
b) λ(G) Km,n = have
n − 1a ifHamilton and onlycircuit? if G = Kn . le
h−1
m Show l ≤that
c h . eTaking d
≤descendants
2v −logarithms
4 hifofvb? to the base m in this inequality gives h − 1 < logm l ≤ h.
h≥ 3.
h) Which
<vertices m are
Hence, h = ⌈logm l⌉. 5. a 6. a b
4. Answer the same questions as listed in Exercise 3 for the
g g c c
21. Consider
rooted tree illustrated. the following tree:
a b c
f f d d
rcises e e
10. Complete
10. Complete the argument
the argumentin Example
in Example 3. 3. d e f d e
b d
11. Show
11. Showthat K
c 5 isKnonplanar
that usingusing
is nonplanar an argument
an argument similar to to
similar
Which of these graphs are trees? that given a)5 Which
in Example 3. 3. vertex is the root?
mine whether the given graph is planar. that given in Example
)etermine whether the given graph
e b) is planar.
g h
12. Suppose
i
that athat
b) Which vertices are internal?
connected
oatedges cross.
no edges cross. f 12. Suppose Whichplanar
c)a connected verticesgraph
planar are has
graph eight
leaves? vertices,
has eight vertices,
eacheach
of degree three.
of degree d) Which vertices are children ofisjplane
Into
three. how
Into many
how regions
many is
regions the the
? plane
divided by a by
o divided planar representation
ae)planar
Which vertex isofthe
representation this
of graph?
this graph?
parent of h?
6. a 6. a j b b c mc n p a connected planar graph has six vertices,
d) k l 13. Suppose
13. Suppose that thatf )a Which
connected planar
vertices aregraph
siblings hasofsixo?vertices,
eacheach
of degree
of degreefour. Into Into
four.
g) Which how manymany
how
vertices regions
are is theof
regions
ancestors isplane
the
m? plane
q divided s by a by
r divided planar representation
ah)planar
Which verticesofare
representation this
of graph?
this graph?of b?
descendants
14. Suppose
14. Suppose that
that a4. a connected
connected
Answer planar
the planar
same graph graph
has 30
questions has 30 edges.
asedges.
listed If a 3 for the
If aExercise
in
5. Is the rooted f ) tree in Exercise 3 a full m-ary tree for some
planarplanar representation
representationrootedoftree ofillustrated.
this this graph
graph dividesdivides the plane
the plane into into
d 22. What
d positive integer
e e values
m? f of fm and n make the complete bipartite graph Km,n a tree?
f 20 regions,
20 regions, how howmanymany vertices
vertices does does athis graph
this graph have?have?
6. Is 23. How many
the rooted tree vertices
in Exercise 4 a does a full
full m-ary tree5-ary
for some tree with 100 internal vertices have?
positive integer m?
7. What areisAthe level of each vertex of the rooted tree in Ex-
Which of these graphs 24.
ercise 3? chain letter starts when a person sends a letter to five
trees? b
c
others. d Each person who receives the
) letter
8. What either
is the
b)
level sends
of each it to five
vertex of theother
rootedpeople
tree in Ex- who have never received it or does not send it to anyone.
Suppose
ercise 4? that 10,000 people send out the letter e before the
f
g chain h ends and i that no one receives
more
9. Draw thethan
subtree one letter.
of the tree How many
in Exercise people
3 that receive the letter, and how many do not send it out?
is rooted
at d) o
ated. a) a. b) c. c) e. j k l m n p

10. Draw the subtree of the tree in Exercise 4 that is rooted

at q r s
a) a. b) c. c) e. 5. Is the rooted tree in Exercise 3 a full m-ary tree for some
11. a) How many nonisomorphic unrooted trees arepositive there integer m?
with three vertices? 6. Is the rooted tree in Exercise 4 a full m-ary tree for some
b) How many f) nonisomorphic rooted trees arepositive there integer m?
25. Let a complete m-ary tree be a full m-ary tree in which every leaf is at the same level. How many
vertices and how many leaves does a complete m-ary tree of height h have?