On the (M, D) number of a graph
Abstract For a connected graph G = (V, E), a monophonic set of G is a set M ⊆ V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbour in...
Guardado en:
| Autores principales: | , , |
|---|---|
| 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-09172019000200255 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|