Double Roman reinforcement number in graphs
For a graph a double Roman dominating function is a function having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then vertex v must have at least one neighbor w with The weight of a double Roman dom...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Taylor & Francis Group
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/891302961fe3473ebd5cfcd180741879 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|