Some results on global dominating sets
A dominating set is called a global dominating set if it is a dominating set for a graph G and its complement G. We investigate some general results for global dominating sets corresponding to the graphs Pn, Cn and Wn.
Guardado en:
Autores principales: | Vaidya,S K, Pandit,R M |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2013
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000300003 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Total domination and vertex-edge domination in tres
por: Venkatakrishnan,Y. B., et al.
Publicado: (2019) -
A note on complementary tree domination number of a tree
por: Krishnakumari,B, et al.
Publicado: (2015) -
Trees with vertex-edge roman domination number twice the domination number minus one
por: Naresh Kumar,H., et al.
Publicado: (2020) -
Vertex cover and edge-vertex domination in tres
por: Senthilkumar,B., et al.
Publicado: (2021) -
On the upper geodetic global domination number of a graph
por: Lenin Xaviour,X., et al.
Publicado: (2020)