New results on upper domatic number of graphs
For a graph G = (V, E), a partition π = {V1, V2, . . . , Vk} of the vertex set V is an upper domatic partition if Vi dominates Vj or Vj dominates Vi or both for every Vi, Vj ∈ π, whenever i 6= j. The upper domatic number D(G) is the maximum order of an upper domatic partition of G. We study the p...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2020-11-01
|
| Series: | Communications in Combinatorics and Optimization |
| Subjects: |