Off-campus ETSU users: To download "Campus Only" theses, please use the following link to log in to our proxy server with your ETSU username and password.

Non-ETSU users: Please talk to your librarian about requesting this thesis through interlibrary loan.

Degree Name

MS (Master of Science)


Mathematical Sciences

Date of Award


Committee Chair or Co-Chairs

Teresa W. Haynes

Committee Members

Debra J. Knisley, Anant P. Godbole


Let SV be an arbitrary subset of vertices of a graph G = (V,E). The differential ∂(S) equals the difference between the cardinality of the set of vertices not in S but adjacent to vertices in S, and the cardinality of the set S. The differential of a graph G equals the maximum differential of any subset S of V . A set S is called a zero set if ∂(S) = 0. In this thesis we introduce the study of zero sets in graphs. We give proofs of the existence of zero sets in various kinds of graphs such as even order graphs, bipartite graphs, and graphs of maximum degree 3. We also give proofs regarding the existence of graphs which contain no zero sets and the construction of zero-free graphs from graphs which contain zero sets.

Document Type

Thesis - restricted


Copyright by the authors.