A characterization of graphs with disjoint dominating and paired-dominating sets |
| |
Authors: | Justin Southey Michael A. Henning |
| |
Affiliation: | 1.School of Mathematical Sciences,University of KwaZulu-Natal,Pietermaritzburg,South Africa |
| |
Abstract: | A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set and the subgraph induced by the set contains a perfect matching. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a dominating set and a paired-dominating set. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |