SciELO - Scientific Electronic Library Online

 
vol.33 número1Some characterization theorems on dominating chromatic partition-covering number of graphsHardy-Type Spaces and its Dual índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

Compartir


Proyecciones (Antofagasta)

versión impresa ISSN 0716-0917

Resumen

RAMA RAJU, S. V. Siva  y  NAGARAJA RAO, I. H. Global neighbourhood domination. Proyecciones (Antofagasta) [online]. 2014, vol.33, n.1, pp.25-41. ISSN 0716-0917.  http://dx.doi.org/10.4067/S0716-09172014000100003.

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, n1,n — 2, n.

Palabras clave : Global neighbourhood domination; global neighbourhood domination number; global domination; restrained domination; connected domination.

        · texto en Español     · Español ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons