A note on complementary tree domination number of a tree
A complementary tree dominating set of a graph G, is a set D of vertices of G such that D is a dominating set and the induced sub graph (V \ D) is a tree. The complementary tree domination number of a graph G, denoted by γctd(G), is the minimum cardinality of a complementary tree dominating...
Guardado en:
Autores principales: | Krishnakumari,B, Venkatakrishnan,Y. B |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000200002 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Trees with vertex-edge roman domination number twice the domination number minus one
por: Naresh Kumar,H., et al.
Publicado: (2020) -
Total domination and vertex-edge domination in tres
por: Venkatakrishnan,Y. B., et al.
Publicado: (2019) -
Vertex cover and edge-vertex domination in tres
por: Senthilkumar,B., et al.
Publicado: (2021) -
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)