Back to results

University of Illinois at Urbana-Champaign

Domination in Sparse Graphs

Abstract

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.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Stodolsky, Burak Yildiran
Contributors dc:contributor
  • West, Douglas B.

Subjects

dc:subject × 1

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
(MiAaPQ)AAI3337932
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/86916

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Stodolsky, Burak Yildiran. Domination in Sparse Graphs. Dissertation thesis, University of Illinois at Urbana-Champaign, 2015. http://hdl.handle.net/2142/86916