Show simple item record

dc.creatorSiva Rama Raju, S. V.es
dc.creatorNagaraja Rao, I. H.es
dc.date2025-04-17
dc.date.accessioned2025-10-06T15:04:54Z
dc.date.available2025-10-06T15:04:54Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1261
dc.identifier10.4067/S0716-09172015000100001
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/255431
dc.descriptionDominating 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 γcnve(G). We have given a characterization result for a ved-set to be a cnved-set and also bounds for this parameter are obtained.es
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1261/974
dc.rightsCopyright (c) 2015 Proyecciones. Journal of Mathematicsen
dc.rightshttps://creativecommons.org/licenses/by/4.0en
dc.sourceProyecciones (Antofagasta); Vol. 34 No. 1 (2015); 1-14en
dc.sourceProyecciones. Revista de Matemática; Vol. 34 Núm. 1 (2015); 1-14es
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2015
dc.titleComplementary nil vertex edge dominating setses
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record