{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-2785"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-2785","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Domination in Graphs","abstract":"Vizing conjectured in 1963 that the domination number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet to be proven in general. The purpose of this thesis was to study Vizing's conjecture, related results, and open problems related to the conjecture. We give a survey of classes of graphs that are known to satisfy the conjecture, and of Vizing-like inequalities and conjectures for different types of domination and graph products. We also give an improvement of the Clark-Suen inequality. Some partial results about fair domination are presented, and we summarize some open problems related to Vizing's conjecture.","abstract_html":"Vizing conjectured in 1963 that the domination number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet to be proven in general. The purpose of this thesis was to study Vizing&#x27;s conjecture, related results, and open problems related to the conjecture. We give a survey of classes of graphs that are known to satisfy the conjecture, and of Vizing-like inequalities and conjectures for different types of domination and graph products. We also give an improvement of the Clark-Suen inequality. Some partial results about fair domination are presented, and we summarize some open problems related to Vizing&#x27;s conjecture.","abstract_has_math":false,"creators":["Tarr, Jennifer M"],"institution":"University of South Florida","degree_name":null,"degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Stephen Suen, Ph.D.","Natasa Jonoska, Ph.D.","Brendan Nagle, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-05-19T07:00:00Z","date_published":"2010-05-19T07:00:00Z","updated_at":"2026-11-19T08:36:33Z","subjects":["Domination","Fair Domination","Edge-Critical Graphs","Vizing’s Conjecture","Graph Theory","American Studies","Arts and Humanities"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/1786","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/1786","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://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-2785","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Stephen Suen, Ph.D.","Natasa Jonoska, Ph.D.","Brendan Nagle, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Tarr, Jennifer M"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-05-19T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.A."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Domination","Fair Domination","Edge-Critical Graphs","Vizing’s Conjecture","Graph Theory","American Studies","Arts and Humanities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/1786"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Vizing conjectured in 1963 that the domination number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet to be proven in general. The purpose of this thesis was to study Vizing's conjecture, related results, and open problems related to the conjecture. We give a survey of classes of graphs that are known to satisfy the conjecture, and of Vizing-like inequalities and conjectures for different types of domination and graph products. We also give an improvement of the Clark-Suen inequality. Some partial results about fair domination are presented, and we summarize some open problems related to Vizing's conjecture."]},{"key":"dc:title","label":"Title","values":["Domination in Graphs"]}]}],"canonical_facts":{"dc:contributor":["Stephen Suen, Ph.D.","Natasa Jonoska, Ph.D.","Brendan Nagle, Ph.D."],"dc:creator":["Tarr, Jennifer M"],"dc:date":["2010-05-19T07:00:00Z"],"dc:description":["Vizing conjectured in 1963 that the domination number of the Cartesian product of two graphs is at least the product of their domination numbers; this remains one of the biggest open problems in the study of domination in graphs. Several partial results have been proven, but the conjecture has yet to be proven in general. The purpose of this thesis was to study Vizing's conjecture, related results, and open problems related to the conjecture. We give a survey of classes of graphs that are known to satisfy the conjecture, and of Vizing-like inequalities and conjectures for different types of domination and graph products. We also give an improvement of the Clark-Suen inequality. Some partial results about fair domination are presented, and we summarize some open problems related to Vizing's conjecture."],"dc:identifier":["https://digitalcommons.usf.edu/etd/1786"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["Domination","Fair Domination","Edge-Critical Graphs","Vizing’s Conjecture","Graph Theory","American Studies","Arts and Humanities"],"dc:title":["Domination in Graphs"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis","M.A."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:36:33Z"}