The upper domatic number of a graph
Let be a graph. For two disjoint sets of vertices and , set dominates set if every vertex in is adjacent to at least one vertex in . In this paper we introduce the upper domatic number , which equals the maximum order of a vertex partition such that for every , , either dominates or dominates , or b...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.09.003 |