On the distance-regularity of odd graphs
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 exce...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2013
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18015 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-18528 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-185282022-01-05T07:31:22Z On the distance-regularity of odd graphs Castillo, Rigel Kent M. Madarang, Kashman T. 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. 2013-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18015 Bachelor's Theses English Animo Repository Physical Sciences and Mathematics |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Physical Sciences and Mathematics |
spellingShingle |
Physical Sciences and Mathematics Castillo, Rigel Kent M. Madarang, Kashman T. On the distance-regularity of odd graphs |
description |
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. |
format |
text |
author |
Castillo, Rigel Kent M. Madarang, Kashman T. |
author_facet |
Castillo, Rigel Kent M. Madarang, Kashman T. |
author_sort |
Castillo, Rigel Kent M. |
title |
On the distance-regularity of odd graphs |
title_short |
On the distance-regularity of odd graphs |
title_full |
On the distance-regularity of odd graphs |
title_fullStr |
On the distance-regularity of odd graphs |
title_full_unstemmed |
On the distance-regularity of odd graphs |
title_sort |
on the distance-regularity of odd graphs |
publisher |
Animo Repository |
publishDate |
2013 |
url |
https://animorepository.dlsu.edu.ph/etd_bachelors/18015 |
_version_ |
1772835340449480704 |