Back to search

CSUniversity San Bernardino - Retro

Minimal congestion trees

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Arts in Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Dawson, Shelly Jean
Contributors dc:contributor
  • Chavez, Joseph
  • Trapp, Rolland
  • Griffing, Gary

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/3005

Chain of custody

source
Harvested from
CSUniversity San Bernardino - Retro
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Dawson, Shelly Jean. Minimal congestion trees. Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/3005