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	An Extremal Problem for Total Domination Stable Graphs Upon Edge Removal Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A. 28 June 2011 (has links) A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number. edge removal stable extremal problem total domination Mathematics and Statistics