## Abstract

A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S. The cardinality of a minimum dominating (total dominating) set of G is called the domination (total domination) number. A set that does not dominate (totally dominate) G is called a non-dominating (non-total dominating) set of G. A partition of the vertices of G into non-dominating (non-total dominating) sets is a non-dominating (non-total dominating) set partition. We show that the minimum number of sets in a non-dominating set partition of a graph G equals the total domination number of its complement Ḡ and the minimum number of sets in a non-total dominating set partition of G equals the domination number of Ḡ. This perspective yields new upper bounds on the domination and total domination numbers. We motivate the study of these concepts with a social network application.

Original language | English |
---|---|

Pages (from-to) | 1043-1050 |

Number of pages | 8 |

Journal | Discussiones Mathematicae - Graph Theory |

Volume | 36 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2016 |

## Keywords

- Domination
- Non-dominating partition
- Non-total dominating partition
- Total domination

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics