{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/86916"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/86916","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Domination in Sparse Graphs","abstract":"Given a partition pi of V (G) with parts ( V1, V2, ... , V t). A pi-dominating set B is a dominating set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say that the vertices in Vi are coupled together. The coupled domination number, gamma cpl(G), is the maximum of gamma(G,pi) over all couplings pi of G. We also study coupled domination in trees. This topic was introduced by Slater and Seo, who established the coupled domination number of several different kinds of trees. They obtained a tree T' with gammacpl( T') = 8 and gamma(T' ) = 5. We show that gcplT gT ≥8/5 for every tree T with at least 2 vertices.","abstract_html":"Given a partition pi of V (G) with parts ( V1, V2, ... , V t). A pi-dominating set B is a dominating set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say that the vertices in Vi are coupled together. The coupled domination number, gamma cpl(G), is the maximum of gamma(G,pi) over all couplings pi of G. We also study coupled domination in trees. This topic was introduced by Slater and Seo, who established the coupled domination number of several different kinds of trees. They obtained a tree T' with gammacpl( T') = 8 and gamma(T' ) = 5. We show that gcplT gT ≥8/5 for every tree T with at least 2 vertices.","abstract_has_math":false,"creators":["Stodolsky, Burak Yildiran"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["West, Douglas B."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-28T15:20:09Z","date_published":"2015-09-28T15:20:09Z","updated_at":"2026-07-22T22:26:28Z","subjects":["Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3337932"],"render_values":[{"text":"(MiAaPQ)AAI3337932","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/86916","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["West, Douglas B."]},{"key":"dc:creator","label":"Author","values":["Stodolsky, Burak Yildiran"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-28T15:20:09Z","10000-01-01","2008"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/86916","(MiAaPQ)AAI3337932"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Given a partition pi of V (G) with parts ( V1, V2, ... , V t). A pi-dominating set B is a dominating set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say that the vertices in Vi are coupled together. The coupled domination number, gamma cpl(G), is the maximum of gamma(G,pi) over all couplings pi of G. We also study coupled domination in trees. This topic was introduced by Slater and Seo, who established the coupled domination number of several different kinds of trees. They obtained a tree T' with gammacpl( T') = 8 and gamma(T' ) = 5. We show that gcplT gT ≥8/5 for every tree T with at least 2 vertices.","Made available in DSpace on 2015-09-28T15:20:09Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3337932.pdf: 3521023 bytes, checksum: f2499da093fb6b7ed2927e668f4eaa1a (MD5) Previous issue date: 2008","Embargo set by: Seth Robbins for item 88197 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","69 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008."]},{"key":"dc:title","label":"Title","values":["Domination in Sparse Graphs"]}]}],"canonical_facts":{"dc:contributor":["West, Douglas B."],"dc:creator":["Stodolsky, Burak Yildiran"],"dc:date":["2015-09-28T15:20:09Z","10000-01-01","2008"],"dc:description":["Given a partition pi of V (G) with parts ( V1, V2, ... , V t). A pi-dominating set B is a dominating set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say that the vertices in Vi are coupled together. The coupled domination number, gamma cpl(G), is the maximum of gamma(G,pi) over all couplings pi of G. We also study coupled domination in trees. This topic was introduced by Slater and Seo, who established the coupled domination number of several different kinds of trees. They obtained a tree T' with gammacpl( T') = 8 and gamma(T' ) = 5. We show that gcplT gT ≥8/5 for every tree T with at least 2 vertices.","Made available in DSpace on 2015-09-28T15:20:09Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3337932.pdf: 3521023 bytes, checksum: f2499da093fb6b7ed2927e668f4eaa1a (MD5) Previous issue date: 2008","Embargo set by: Seth Robbins for item 88197 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","69 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008."],"dc:identifier":["http://hdl.handle.net/2142/86916","(MiAaPQ)AAI3337932"],"dc:language":["eng"],"dc:subject":["Mathematics"],"dc:title":["Domination in Sparse Graphs"],"dc:type":["text"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:28Z"}