Vertices in all minimum paired-dominating sets of block graphs

Details Vertices in all minimum paired-dominating sets of block graphs Vertices in all minimum paired-dominating sets of block graphs

2009-08-20

arxiv.org/abs/0908.2883v1

Mathematics

Combinatorics

Scientific paper

Let $G=(V,E)$ be a simple graph without isolated vertices. A set $S\subseteq
V$ is a paired-dominating set if every vertex in $V-S$ has at least one
neighbor in $S$ and the subgraph induced by $S$ contains a perfect matching. In
this paper, we present a linear-time algorithm to determine whether a given
vertex in a block graph is contained in all its minimum paired-dominating sets.

Affiliated with

Also associated with

No associations

Rating

Vertices in all minimum paired-dominating sets of block graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertices in all minimum paired-dominating sets of block graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertices in all minimum paired-dominating sets of block graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-526070