| dc.creator | Siva Rama Raju, S. V. | es |
| dc.creator | Nagaraja Rao, I. H. | es |
| dc.date | 2017-03-23 | |
| dc.date.accessioned | 2025-10-06T15:04:56Z | |
| dc.date.available | 2025-10-06T15:04:56Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1292 | |
| dc.identifier | 10.4067/S0716-09172014000100003 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255462 | |
| 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 |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | en |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1292/1004 | |
| dc.rights | Copyright (c) 2014 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 33 No. 1 (2014); 25-41 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 33 Núm. 1 (2014); 25-41 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2014 | |
| dc.title | Global neighbourhood domination | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
