Total domination and vertex-edge domination in tres
Abstract: A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex...
Guardado en:
Autores principales: | Venkatakrishnan,Y. B., Kumar,H. Naresh, Natarajan,C. |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000200295 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Vertex cover and edge-vertex domination in tres
por: Senthilkumar,B., et al.
Publicado: (2021) -
Trees with vertex-edge roman domination number twice the domination number minus one
por: Naresh Kumar,H., et al.
Publicado: (2020) -
A note on complementary tree domination number of a tree
por: Krishnakumari,B, et al.
Publicado: (2015) -
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)