Quaestiones Mathematicae · 2009 · 31 citations · 0 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsSet TheoryDirected Acyclic GraphsDominance HierarchiesGraph AlgorithmsGraph TheoryDominance AnalysisDominating SetsGraph Partitioning
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 total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a dominating set and a total dominating set. Keywords: DOMINATIONTOTAL DOMINATIONVERTEX PARTITION