Global ETD Search

About
The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

1	Domination Parameters of a Graph and Its Complement Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A. 01 January 2018 (has links) A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement. clique domination complement connected domination domination restrained domination total domination Mathematics and Statistics