Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

5-2003

Committee Chair or Co-Chairs

Teresa W. Haynes

Committee Members

Anant P. Godbole, Debra J. Knisley

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.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS