On an improvement of the Boshier-Nomura bound

Date of Publication

1994

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

Let be a Distance Regular Graph with Intersection Array* 1 1 1 11 ... 1...k k - 1 k - 1 k - 2 k - 2This thesis shows that if r 0 then s 4. An earlier result by A. Boshier and K. Nomura states that s 4 if r 0.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU06654

Shelf Location

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

Physical Description

62 leaves

Keywords

Graph theory; Combinatorial analysis

This document is currently not available here.

Share

COinS