Let (Formula presented.) be a graph. For two disjoint sets of vertices (Formula presented.) and (Formula presented.), set (Formula presented.) dominates set (Formula presented.) if every vertex in (Formula presented.) is adjacent to at least one vertex in (Formula presented.). In this paper we introduce the upper domatic number (Formula presented.), which equals the maximum order (Formula presented.) of a vertex partition (Formula presented.) such that for every (Formula presented.), (Formula presented.), either (Formula presented.) dominates (Formula presented.) or (Formula presented.) dominates (Formula presented.), or both. We study properties of the upper domatic number of a graph, determine bounds on (Formula presented.), and compare (Formula presented.) to a related parameter, the transitivity (Formula presented.) of (Formula presented.).
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-10382 |
| Date | 02 January 2020 |
| Creators | Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice, Phillips, Nicholas |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | ETSU Faculty Works |
| Rights | http://creativecommons.org/licenses/by/4.0/ |
Page generated in 0.0572 seconds