{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-1037"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-1037","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Vertices in Total Dominating Sets.","abstract":"Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and rho-poor if g < b. In this thesis the property of interest is total domination. The total domination number, gammat, is the cardinality of a smallest total dominating set in a graph. We investigate gammat-excellent, gammat-commendable, gammat-fair, and gammat-poor graphs.","abstract_html":"Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g &gt; b &gt; 0, rho-fair if g = b, and rho-poor if g &lt; b. In this thesis the property of interest is total domination. The total domination number, gammat, is the cardinality of a smallest total dominating set in a graph. We investigate gammat-excellent, gammat-commendable, gammat-fair, and gammat-poor graphs.","abstract_has_math":false,"creators":["Dautermann, Robert Elmer, III"],"institution":null,"degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2000,"date_issued":"2000-05-01T07:00:00Z","date_published":"2000-05-01T07:00:00Z","updated_at":"2026-11-19T07:51:15Z","subjects":["domination","total domination","graph theory","mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/5","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/5","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/1037/viewcontent/RobThesis.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-1037","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Dautermann, Robert Elmer, III"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2000-01-01T08:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2000-05-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["domination","total domination","graph theory","mathematics","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/1037/viewcontent/RobThesis.pdf","https://dc.etsu.edu/etd/5"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and rho-poor if g < b. In this thesis the property of interest is total domination. The total domination number, gammat, is the cardinality of a smallest total dominating set in a graph. We investigate gammat-excellent, gammat-commendable, gammat-fair, and gammat-poor graphs."]},{"key":"dc:title","label":"Title","values":["Vertices in Total Dominating Sets."]}]}],"canonical_facts":{"dc:creator":["Dautermann, Robert Elmer, III"],"dc:date.available":["2000-01-01T08:00:00Z"],"dc:date.issued":["2000-05-01T07:00:00Z"],"dc:description.abstract":["Fricke, Haynes, Hedetniemi, Hedetniemi, and Laskar introduced the following concept. For a graph G = (V,E), let rho denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called rho-excellent if every vertex in V is rho-good, rho-commendable if g > b > 0, rho-fair if g = b, and rho-poor if g < b. In this thesis the property of interest is total domination. The total domination number, gammat, is the cardinality of a smallest total dominating set in a graph. We investigate gammat-excellent, gammat-commendable, gammat-fair, and gammat-poor graphs."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/1037/viewcontent/RobThesis.pdf","https://dc.etsu.edu/etd/5"],"dc:rights":["Copyright by the authors."],"dc:subject":["domination","total domination","graph theory","mathematics","Physical Sciences and Mathematics"],"dc:title":["Vertices in Total Dominating Sets."],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"]},"updated_at":"2026-11-19T07:51:15Z"}