Date of Defense

Spring 4-12-1994

Department

Mathematics

First Advisor

Yousef Alavi, Mathematics and Statistics

Second Advisor

Allen Schwenk, Mathematics and Statistics

Third Advisor

Arthur Falk, Philosophy

Abstract

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.

Access Setting

Honors Thesis-Open Access

Share

COinS