Date of Award
2006
Document Type
Thesis
Degree Name
Master of Arts in Mathematics
Department
Mathematics
First Advisor
Chavez, Joseph
Second Advisor
Trapp, Rolland
Third Advisor
Griffing, Gary
Abstract
Analyzes the results of M.I. Ostrovskii's theorem of inequalities which estimate the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion tree for some grids while forming a conjecture for all grids.
Recommended Citation
Dawson, Shelly Jean, "Minimal congestion trees" (2006). Theses Digitization Project. 3005.
https://scholarworks.lib.csusb.edu/etd-project/3005
