Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Bounds on Total Domination Subdivision Numbers.

Abstract

The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph. Likewise, the total domination subdivision number is the minimum number of edges that must be subdivided in order to increase the total domination number. First, this thesis provides a complete survey of established bounds on the domination subdivision number and the total domination subdivision number. Then in Chapter 4, new results regarding bounds on the total domination subdivision number are given. Finally, a characterization of the total domination subdivision number of caterpillars is presented in Chapter 5

Similar works

This paper was published in East Tennessee State University.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.