| dc.creator | Siva Rama Raju, S. V. | |
| dc.creator | Nagaraja Rao, I. H. | |
| dc.date | 2015-03-01 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/1261 | |
| dc.identifier | 10.4067/S0716-09172015000100001 | |
| dc.description | 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 γ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-ES |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | es-ES |
| dc.relation | http://www.revistaproyecciones.cl/article/view/1261/974 | |
| dc.rights | Derechos de autor 2015 Proyecciones. Journal of Mathematics | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 34 No 1 (2015); 1-14 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 34 Núm. 1 (2015); 1-14 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Complementary nil vertex edge dominating sets | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Artículo revisado por pares | es-ES |
