Date of Defense
Yousef Alavi, Mathematics and Statistics
Allen Schwenk, Mathematics and Statistics
Arthur Falk, Philosophy
A graph G is regular of degree d if for every vertex v in G there exist exactly d vertices at distance 1 from v. A graph G is kth order regular of degree d if for every vertex v in G, there exist exactly d vertices at distance k from v. In this paper, third order regular graphs of degree 1 with small order are characterized.
Hayes, Leslie D., "Third Order Degree Regular Graphs" (1994). Honors Theses. 272.
Honors Thesis-Open Access