Title

On the distance-regularity of odd graphs

Date of Publication

2013

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

Subject Categories

Physical Sciences and Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Thesis Adviser

John Vincent S. Morales

Defense Panel Chair

Jose Tristan F. Reyes

Defense Panel Member

Francis Joseph H. Campena
Edmundo R. Perez

Abstract/Summary

This thesis is an exposition of a paper entitled An odd characterization of the gen- eralized odd graphs by Edwin R. Van Dam and Willem H. Haemers. The Spectral Excess Theorem states that a connected graph {u100000} is distance-regular if the average excess of {u100000} is equal to its spectral excess. This theorem was proven by Fiol and Garriaga in 1997. In this paper we use the Spectral Excess Theorem to show that any connected k-regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is distance-regular.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU019065

Shelf Location

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

This document is currently not available here.

Share

COinS