The block perfect domination number of a graph

Ramachandra, S. R. and Soner, N. D. (2009) The block perfect domination number of a graph. Adv. Appl. Discrete Math., 4 (2). pp. 161-168.

Full text not available from this repository. (Request a copy)
Official URL: http://www.pphmj.com/abstract/4473.htm

Abstract

Let G=(V,E) be a graph. A set D⊆V is called a perfect dominating set if every vertex in V−D is adjacent to exactly one vertex in D. A perfect dominating set D is said to be a connected cutfree perfect dominating set if the induced subgraph ⟨D⟩ of G is a connected graph having no cutvertex. D is called a block perfect dominating set if ⟨D⟩ is a block in G. The connected cutfree perfect domination number γccp∗(G) is the minimum cardinality taken over all minimal connected cutfree perfect dominating sets and the block perfect dominating number γccp∗(G) is the minimum cardinality taken over all minimal block perfect dominating sets in G. In this paper, we study the properties of these two perfect domination numbers and investigate their relationships with other domination parameters.

Item Type: Article
Subjects: Physical Sciences > Mathematics
Divisions: PG Campuses > Manasagangotri, Mysore > Mathematics
Depositing User: Kodandarama
Date Deposited: 28 May 2013 03:38
Last Modified: 28 May 2013 03:38
URI: http://eprints.uni-mysore.ac.in/id/eprint/10960

Actions (login required)

View Item View Item