Vertex cover and edge-vertex domination in tres
Abstract Let G = (V,E) be a simple graph. An edge e ∈ E(G) edge-vertex dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. A subset D ⊆ E(G) is an edge-vertex dominating set of a graph G if every vertex of G is edge-vertex...
Guardado en:
Autores principales: | Senthilkumar,B., Kumar,H. Naresh, Venkatakrishnan,Y. B. |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000501147 |
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) -
Trees with vertex-edge roman domination number twice the domination number minus one
por: Naresh Kumar,H., et al.
Publicado: (2020) -
Complementary nil vertex edge dominating sets
por: Siva Rama Raju,S. V., et al.
Publicado: (2015) -
A note on complementary tree domination number of a tree
por: Krishnakumari,B, et al.
Publicado: (2015) -
Graphs of edge-to-vertex detour number 2
por: Santhakumaran,A. P.
Publicado: (2021)