{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-project-4022"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-project-4022","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Minimal congestion trees","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.","abstract_html":"Analyzes the results of M.I. Ostrovskii&#x27;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.","abstract_has_math":false,"creators":["Dawson, Shelly Jean"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Chavez, Joseph","Trapp, Rolland","Griffing, Gary"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:07:04Z","subjects":["Trees (Graph theory)","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd-project/3005","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd-project/3005","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-project-4022","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Chavez, Joseph","Trapp, Rolland","Griffing, Gary"]},{"key":"dc:creator","label":"Author","values":["Dawson, Shelly Jean"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2006-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Trees (Graph theory)","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd-project/3005"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Minimal congestion trees"]}]}],"canonical_facts":{"dc:contributor":["Chavez, Joseph","Trapp, Rolland","Griffing, Gary"],"dc:creator":["Dawson, Shelly Jean"],"dc:date.created":["2006-01-01T08:00:00Z"],"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."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd-project/3005"],"dc:subject":["Trees (Graph theory)","Mathematics"],"dc:title":["Minimal congestion trees"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:07:04Z"}