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.
| Identifer | oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-4022 |
| Date | 01 January 2006 |
| Creators | Dawson, Shelly Jean |
| Publisher | CSUSB ScholarWorks |
| Source Sets | California State University San Bernardino |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses Digitization Project |
Page generated in 0.0022 seconds