Return to search

A Characterization of Large (<em>t,r</em>)-Regular Graphs.

A graph G is a (t,r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. In this thesis, we will present a complete characterization of (t,r)-regular graphs of order n if n is sufficiently large. Furthermore, we will show that all graphs of this type are isomorphic to Ks + mKp where t(p - 1) + s = r.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etd-1039
Date01 May 2000
CreatorsGosnell, Shannon Leah
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceElectronic Theses and Dissertations
RightsCopyright by the authors.

Page generated in 0.0018 seconds