The k-Tuple Domatic Number of a Graph

Details The k-Tuple Domatic Number of a Graph The k-Tuple Domatic Number of a Graph

2011-06-28

arxiv.org/abs/1106.5589v1

Mathematics

Combinatorics

Scientific paper

For every positive integer $k$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple dominating set of $G$ if every vertex of $V-S$ is adjacent to least $k$ vertices and every vertex of $S$ is adjacent to least $k-1$ vertices in $S$. The minimum cardinality of a $k$-tuple dominating set of $G$ is the $k$-tuple domination number of $G$. When $k=1$, a $k$-tuple domination number is the well-studied domination number. We define the $k$-tuple domatic number of $G$ as the largest number of sets in a partition of $V$ into $k$-tuple dominating sets. Recall that when $k=1$, a $k$-tuple domatic number is the well-studied domatic number. In this work, we derive basic properties and bounds for the $k$-tuple domatic number.

Affiliated with

Also associated with

No associations

Rating

The k-Tuple Domatic Number of a Graph 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 The k-Tuple Domatic Number of a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The k-Tuple Domatic Number of a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40862