Date of Publication

12-1998

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

Subject Categories

Discrete Mathematics and Combinatorics | Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Yolando B. Beronque

Defense Panel Chair

Severino V. Gervacio

Defense Panel Member

Arlene A. Pascasio
Rigor B. Ponsones

Abstract/Summary

This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (s, c, a, k)-Graphs . In this paper, the following are presented: 1. A diameter bound theorem for a class of distance-regular graphs which includes all those with even girth. 2. A new class of graphs, called (s, c, a, k)-graphs, which are conjectured to contain enough of the local structure of finite distance-regular graphs for them to be all finite. 3. A (s, c, a, k)-graph is finite and a bound on the diameter is given if a - c.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

TG02827

Shelf Location

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

Physical Description

viii, 65 leaves

Keywords

Graph theory; Combinatorial analysis; Mathematics; Paths and cycles (Graph theory)

Upload Full Text

wf_yes

Download

Share

COinS