Back to results
University of Illinois at Urbana-Champaign
Distance-Regular Graphs and Generalizations
Abstract
dc:descriptionA distance-transitive graph (GAMMA) is an undirected, locally finite graph where for any vertices u,v,x,y, (PAR-DIFF)(u,v) = (PAR-DIFF)(x,y) implies (sigma)u = x and (sigma)v = y for some automorphism (sigma) of (GAMMA). Distance-transitive graphs have certain combinatorial properties, which can be studied independently; a graph with these properties is called distance-regular.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Terwilliger, Paul M.
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8218574
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/71204