On homogeneous graphs and regular near polygons
Date of Publication
1999
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Yolando B. Beronque
Defense Panel Chair
Severino D. Diesto
Defense Panel Member
Blessilda P. Raposa
Rigor Ponsones
Abstract/Summary
This thesis is a detailed study about Distance-Regular Graphs having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. Such graphs are called homegeneous graphs. Elementary properties of homogeneous graphs are presented in detail and shown to be closely related with regular near polygons, as proven in the following result:Let T be a Distance Regular Graph of diameter d in which D(u, v) is a clique for each uv. Then T is homogeneous if and only if it is a regular near 2d-gon.
Abstract Format
html
Language
English
Format
Accession Number
TG02905
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
69 numb. leaves
Keywords
Graph theory; Polygons; Combinatorial analysis
Recommended Citation
Salazar, D. (1999). On homogeneous graphs and regular near polygons. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/2007
