Quasi-total Roman Domination in Graphs
[EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in the subgraph induced by the set of vertic...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/160794 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/160794 |
| Access Level: | acceso abierto |
| Palabra clave: | Quasi-total Roman domination number Roman domination number Total Roman domination number ESTADISTICA E INVESTIGACION OPERATIVA |
| Sumario: | [EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in the subgraph induced by the set of vertices labeled with 1 and 2, then f(x) = 1. The weight of a quasi-total Roman dominating function is the value omega(f) = f(V) = Sigma(u is an element of V) f(u). The minimum weight of a quasi-total Roman dominating function on a graph G is called the quasi-total Roman domination number of G. We introduce the quasi-total Roman domination number of graphs in this article, and begin the study of its combinatorial and computational properties. |
|---|