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: | Rama Raju,S. V. Siva, Nagaraja Rao,I. H |
---|---|
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!
|
Ejemplares similares
-
On the upper geodetic global domination number of a graph
por: Lenin Xaviour,X., et al.
Publicado: (2020) -
Complementary nil vertex edge dominating sets
por: Siva Rama Raju,S. V., et al.
Publicado: (2015) -
Some results on global dominating sets
por: Vaidya,S K, et al.
Publicado: (2013) -
Equi independent equitable dominating sets in graphs
por: Vaidya,S. K., et al.
Publicado: (2016) -
The nonsplit domination in subdivision graph
por: Chrislight,R. Jemimal, et al.
Publicado: (2020)