Global neighbourhood domination
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 G N, where G N is the neighbourhood graph of G. The global neighbourhood domination number(gnd - number) is the minimum cardinality of a global neigh...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | Spanish / Castilian |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2014
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000100003 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172014000100003 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720140001000032014-01-06Global neighbourhood dominationRama Raju,S. V. SivaNagaraja Rao,I. H Global neighbourhood domination global neighbourhood domination number global domination restrained domination connected domination 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 G N, where G N 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.33 n.1 20142014-03-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000100003es10.4067/S0716-09172014000100003 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
Spanish / Castilian |
| topic |
Global neighbourhood domination global neighbourhood domination number global domination restrained domination connected domination |
| spellingShingle |
Global neighbourhood domination global neighbourhood domination number global domination restrained domination connected domination Rama Raju,S. V. Siva Nagaraja Rao,I. H Global neighbourhood domination |
| 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 G N, where G N 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. |
| author |
Rama Raju,S. V. Siva Nagaraja Rao,I. H |
| author_facet |
Rama Raju,S. V. Siva Nagaraja Rao,I. H |
| author_sort |
Rama Raju,S. V. Siva |
| title |
Global neighbourhood domination |
| title_short |
Global neighbourhood domination |
| title_full |
Global neighbourhood domination |
| title_fullStr |
Global neighbourhood domination |
| title_full_unstemmed |
Global neighbourhood domination |
| title_sort |
global neighbourhood domination |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2014 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000100003 |
| work_keys_str_mv |
AT ramarajusvsiva globalneighbourhooddomination AT nagarajaraoih globalneighbourhooddomination |
| _version_ |
1718439794897321984 |