Complementary nil vertex edge dominating sets

Dominating sets play a vital role in day-to-day life problems. For-providing effective services in a location, central points are to be identified. This can easily be achieved by graph theoretic techniques. Such graphs and relevant parameters are introduced and extensively studied. One such parameter is complementary nil vertex edge dominating set(cnved-set). A vertex edge dominating set(ved-set) of a connected graph G with vertex set V is said to be a complementary nil vertex edge dominating set(cnved-Set) of G if and only if V - D is not a ved-set of G. A cnved-set of minimum cardinality is called a minimum cnved-set(mcnved-set)of G and this minimum cardinality is called the complementary nil vertex-edge domination number of G and is denoted by &#947cnve(G). We have given a characterization result for a ved-set to be a cnved-set and also bounds for this parameter are obtained.

Bibliographic Details

Main Authors:	Siva Rama Raju,S. V., Nagaraja Rao,I. H.
Format:	Digital revista
Language:	English
Published:	Universidad Católica del Norte, Departamento de Matemáticas 2015
Online Access:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000100001
Tags:	Add Tag No Tags, Be the first to tag this record!