| Paired Domination of Cartesian Products of Graphs |
| Received:February 13, 2008 Revised:July 07, 2008 |
| Key Words:
domination paired domination Cartesian product.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.10701068; 10671191). |
|
| Hits: 2936 |
| Download times: 2814 |
| Abstract: |
| Let $\g_{pr}(G)$ denote the paired domination number and $G\sq H$ denote the Cartesian product of graphs $G$ and $H$. In this paper we show that for all graphs $G$ and $H$ without isolated vertex, $\g_{pr}(G)\g_{pr}(H)\le 7\g_{pr}(G\sq H)$. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2010.01.018 |
| View Full Text View/Add Comment |
