Date of Publication

8-4-1994

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Yolando Beronque

Defense Panel Chair

Blessilda Raposa

Defense Panel Member

Arlene Pascasio
Severino Diesto

Abstract/Summary

Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, with 0 i + j d and vertices u, v E , letki = number of points at distance i from u and kj = number of points at distance j from v. This thesis is a detailed study about distance regular graphs satisfying ki = kj. In particular, it aims to show the following: a. The number of vertices at distance d from any vertex u E is 1.b. The number of points at distance e from u with i , e j, is constant. c. If the number of points at distance j from u is not equal to the number of points at distance (j+1) from u, then the points at distance d from u form a clique for any vertex u E .This thesis is based on the paper of Hiroshi Suzuki entitled On Distance Regular Graphs with Ki = kj.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG02363

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

113 leaves

Keywords

Graph theory; Combinatorial analysis

Upload Full Text

wf_yes

Download

Share

COinS