On the Quasi-Total Roman Domination Number of Graphs
Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems, computer and social networks, monitoring communicati...
Guardado en:
Autores principales: | Abel Cabrera Martínez, Juan C. Hernández-Gómez, José M. Sigarreta |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/015c5da0dbe841629984a5c90c342bd2 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
On a conjecture concerning total domination subdivision number in graphs
por: S. Kosari, et al.
Publicado: (2021) -
Double Roman reinforcement number in graphs
por: J. Amjadi, 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) -
Total domination and vertex-edge domination in tres
por: Venkatakrishnan,Y. B., et al.
Publicado: (2019) -
Independent point-set domination in line graphs
por: Purnima Gupta, et al.
Publicado: (2021)