Surekha, . and Bhat , Pradeep G (2011) Mixed Block Domination in Graphs. Journal ofInternational Academy of Physical Sciences, 15 (3). pp. 345-357. ISSN 0974 - 9373

PDF Mixed block domination.pdf - Published Version Restricted to Registered users only Download (6MB) | Request a copy

Abstract

Let B( G) denotes the set of all blocks of a graph G. A vertex V E V and a block b E B( G) is said to block dominate (b-dominate) each other if v is in the block b. A set D ~ V is said to be a vertex block dominating set (VBD set) if every block in G is b-dorninated by some vertex in D. The vertex - block domina/ion number r vb = r.b (G) is the minimum cardinality of a block dominating set of G. Similarly a set F ~ B( G) is said to be a block - vertex dominating set (BVD set) if every vertex in G is b-dominated by some block in F. The block. vertex domination number rbv = rb) G) is the minimum cardinality of a block vertex dominating set of G. In this paper we initiate a study of these new varieties of mixed block domination and obtain few bounds on the new parameter.

Item Type:	Article
Uncontrolled Keywords:	Vertex block domination, block vertex domination, Block tree. Block degree.
Subjects:	Engineering > MIT Manipal > Mathematics
Depositing User:	MIT Library
Date Deposited:	07 Jun 2014 05:30
Last Modified:	07 Jun 2014 05:30
URI:	http://eprints.manipal.edu/id/eprint/139676

Actions (login required)

View Item