On distance regular graphs with b2=1 and antipodal covers
Date of Publication
1998
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Dr. Yolando Beronque
Defense Panel Chair
Dr. Severino Gervacio
Defense Panel Member
Dr. Arlene Pascasio
Rigor Ponsones
Abstract/Summary
This thesis is an exposition of the paper entitled On Distance Regular Graphs with b2 = 1 and Antipodal Covers by Makoto Araya, Akira Hiraki, and Alexander Jurisic.Let T be a Distance Regular Graph of valency k2. It is shown that if b2 = 1, the T is antipodal and one of the following holds:(1) T is the dodecahedron(2) d = 4 and T is antipodal double cover for a Strongly Regular Graph with parameters (k, a1, c2) = (n2 + 1, 0, 2) for an integer n not divisible by four.(3) d = 3 and T is an antipodal cover of a complete graph.
Abstract Format
html
Language
English
Format
Accession Number
TG02838
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
90 leaves
Keywords
Graph theory; Combinatorial analysis; Mathematics; Combinatorial packing and covering
Recommended Citation
Soriano, R. V. (1998). On distance regular graphs with b2=1 and antipodal covers. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/1959