Total and paired domination numbers of toroidal meshes

Details Total and paired domination numbers of toroidal meshes Total and paired domination numbers of toroidal meshes

2011-09-19

arxiv.org/abs/1109.3928v1

Mathematics

Combinatorics

8 pages with 2 figures

Scientific paper

Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes, i.e., the Cartesian product of two cycles $C_n$ and $C_m$ for any $n\ge 3$ and $m\in\{3,4\}$, and gives some upper bounds for $n, m\ge 5$.

Affiliated with

Also associated with

No associations

Rating

Total and paired domination numbers of toroidal meshes 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 Total and paired domination numbers of toroidal meshes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Total and paired domination numbers of toroidal meshes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96199