i4 'l{ 6s7
+gfll'jc6
@ De I^a Salle University
Horuoropy IN Gnapns
A Thesis Presented to
The Faculty of the Mathematics Department College of
ScienceDe La Salle University
In Partial Fulfillment
of the Requirements for the
DegreeMaster of
Sciencein Mathematics
by
Felix L.;p"ao
August
1999@ De I^a salle university
Abstract
This thesis is an exposition of Sections
l
to 7 of the article entitled "Homotopy in Q-Polynomial Distance-Regular Graphs" by Heather A. Lewis submitted to Dis- crete Mathematics. The aforementioned article constitutes the first two chaptersof Lewis' dissertation "Homotopy and Distance-Regular Graphs", University of Wisconsin Madison, U.S.A, 1997.
Let G
denote an undirected graphwithout
loopsor
multiple edges.Fix
a vertexr
in G, and consider the set/(r)
of all closed paths in G with base vertexr.
We define a relation onthis
set, called homotopy, and provethat it
is an equivalencerelation.
We denote th-e equivalence classes byzr(r)
and show that path concatenation induces a group structure onz'(r).
We define essential length of an element in zr'(r), and using this concept, we define a collection of subgroupsr(r,i).
i
Now, suppose ,r, gr are vertices in G, and suppose there exists a path from c to
g.
We show the groups zr(u) andr(y)
arc isomorphic, andthat
the isomorphism preserves essential length.@ De Ia Salle university
We define a geodesic path and prove a sufficient condition for a path
to
be geodesic. Finally, we assume G is finite and connected with diameter d. We find an upper bound for the length of a geodesic closed path. We prove that for anyfix vertex