Sharada, B.
(2013)
*Trees with equal perfect and restrained domination numbers.*
Advanced Studies in Contemporary Mathematics (Kyungshang), 23 (1).
pp. 81-84.

## Abstract

A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is adjacent to exactly one vertex in D. The perfect domination number of G, is the minimum cardinality of a perfect dominating set of G. A set D of verices is a restrained dominating set if every vertex in V \textbackslashD is adjacent to a vertex in D and another vertex in V \textbackslashD. The restrained domination number is the minimum cardinality of a restrained dominating set of G. We characterize all trees, for which perfect domination and restrained domination numbers are equal.

Item Type: | Article |
---|---|

Subjects: | D Physical Science > Computer Science |

Divisions: | Department of > Computer Science |

Depositing User: | Arshiya Kousar Library Assistant |

Date Deposited: | 14 Nov 2019 06:02 |

Last Modified: | 14 Nov 2019 06:02 |

URI: | http://eprints.uni-mysore.ac.in/id/eprint/9679 |

### Actions (login required)

View Item |