Paired-domination of Trees

Authors:
Hong Qiao;Liying Kang;Mihaela Cardei;Ding-Zhu Du
Affiliations:
Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong, China/;Department of Mathematics, Shanghai University, Shanghai 200436, 3 China/ E-mail: kangly@online.sh.cn;Department of Computer Science and Engineering,University of Minnesota, Minneapolis, MN 55455, USA/E-mail: hmihaela@cs.umn.edu;Department of Computer Science and Engineering,University of Minnesota, Minneapolis, MN 55455, USA/E-mail: dzdj@cs.umn.edu
Venue:
Journal of Global Optimization
Year:
2003

Citing 3
Cited 16

Vertices contained in every minimum dominating set of a tree

Journal of Graph Theory
Characterizations of trees with equal domination parameters

Journal of Graph Theory
A characterization of (γ, i)-trees

Journal of Graph Theory

Paired-domination in inflated graphs

Theoretical Computer Science
Paired domination on interval and circular-arc graphs

Discrete Applied Mathematics
A polynomial-time algorithm for the paired-domination problem on permutation graphs

Discrete Applied Mathematics
Locating and paired-dominating sets in graphs

Discrete Applied Mathematics
Hardness results and approximation algorithms for (weighted) paired-domination in graphs

Theoretical Computer Science
Distance paired-domination problems on subclasses of chordal graphs

Theoretical Computer Science
A linear-time algorithm for paired-domination problem in strongly chordal graphs

Information Processing Letters
On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)

Journal of Combinatorial Optimization
Which trees have a differentiating-paired dominating set?

Journal of Combinatorial Optimization
Upper paired-domination in claw-free graphs

Journal of Combinatorial Optimization
A characterization of graphs with disjoint dominating and paired-dominating sets

Journal of Combinatorial Optimization
Complexity of distance paired-domination problem in graphs

Theoretical Computer Science
Vertices in all minimum paired-dominating sets of block graphs

Journal of Combinatorial Optimization
An O(n)-time algorithm for the paired domination problem on permutation graphs

European Journal of Combinatorics
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

Discrete Applied Mathematics
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

Let G= (V, E) be a graph without isolated vertices. A set S⊂V is a paired-dominating set if it dominates V and the subgraph induced by S,≤S\ge, contains a perfect matching. The paired-domination number γp(G) is defined to be the minimum cardinality of a paired-dominating set S in G. In this paper, we present a linear-time algorithm computing the paired-domination number for trees and characterize trees with equal domination and paired-domination numbers.