Perfect Domination Excellent Trees

Sharada, B. (2012) Perfect Domination Excellent Trees. International Journal of Mathematical Combinatorics, 2. pp. 76-80. ISSN 1937 - 1055

Full text not available from this repository. (Request a copy)
Official URL:


A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some perfect dominating set of minimum cardinality. We also provide a constructive characterization of perfect domination excellent trees

Item Type: Article
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: C Swapna Library Assistant
Date Deposited: 28 Aug 2019 06:06
Last Modified: 28 Aug 2019 06:06

Actions (login required)

View Item View Item