# A Study Of The Upper Domatic Number Of A Graph

- ASU Author/Contributor (non-ASU co-authors, if there are any, appear on document)
- Nicholas Phillips (Creator)
- Institution
- Appalachian State University (ASU )
- Web Site: https://library.appstate.edu/
- Advisor
- Alice McRae

**Abstract:** Given a graph G we can partition the vertices of G in to k disjoint sets. We say a set A of vertices dominates another set of vertices, B, if for every vertex in B there is some adjacent vertex in A. The upper domatic number of a graph G is written as D(G) and defined as the maximum integer k such that G can be partitioned into k sets where for every pair of sets A and B either A dominates B or B dominates A or both. In this thesis we introduce the upper domatic number of a graph and provide various results on the properties of the upper domatic number, notably that D(G) is less than or equal to the maximum degree of G, as well as relating it to other well-studied graph properties such as the achromatic, pseudoachromatic, and transitive numbers.

A Study Of The Upper Domatic Number Of A Graph

PDF (Portable Document Format)

301 KB

Created on 5/31/2017

Views: 888

## Additional Information

- Publication
- Thesis
- Phillips, N. (2017). "A Study Of The Upper Domatic Number Of A Graph." Unpublished Masterâ€™s Thesis. Appalachian State University, Boone, NC.
- Language: English
- Date: 2017
- Keywords
- Graph theory, domination, upper domatic number, partitioning

Email this document to