| dc.creator | Siva Rama Raju, S. V. | |
| dc.creator | Nagaraja Rao, I. H. | |
| dc.date | 2017-03-23 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/1292 | |
| dc.identifier | 10.4067/S0716-09172014000100003 | |
| dc.description | A subset D of vertices of a graph G is called a global neighbourhood dominating set(gnd - set) if D is a dominating set for both G and GN, where GN is the neighbourhood graph of G. The global neighbourhood domination number(gnd - number) is the minimum cardinality of a global neighbourhood dominating set of G and is denoted by γ gn(G). In this paper sharp bounds for γ gn, are supplied for graphs whose girth is greater than three. Exact values ofthis number for paths and cycles are presented as well. The characterization result for a subset ofthe vertex set of G to be a global neighbourhood dominating set for G is given and also characterized the graphs of order n having gnd -numbers 1, 2, n — 1,n — 2, n. | 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/1292/1004 | |
| dc.rights | Derechos de autor 2014 Proyecciones. Journal of Mathematics | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 33 No 1 (2014); 25-41 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 33 Núm. 1 (2014); 25-41 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Global neighbourhood domination | 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 |
