| dc.contributor.author | Campanelli, Nicolás | |
| dc.contributor.author | Kuziak, Dorota | |
| dc.contributor.other | Estadística e Investigación Operativa | es_ES |
| dc.date.accessioned | 2024-02-08T14:38:33Z | |
| dc.date.available | 2024-02-08T14:38:33Z | |
| dc.date.issued | 2019-06-30 | |
| dc.identifier.issn | 0166-218X | |
| dc.identifier.uri | http://hdl.handle.net/10498/30893 | |
| dc.description.abstract | A total Roman dominating function of a graph $G=(V,E)$ is a function $f: V(G)\to \{0,1,2\}$ such that for every vertex $v$ with $f(v)=0$ there exists a vertex $u$ adjacent to $v$ with $f(u)=2$, and such that the subgraph induced by the set of vertices labeled one or two has no isolated vertices. The total Roman domination number of $G$ is the minimum value of the sums $\sum_{v\in V}{f(v)}$ over all total Roman dominating functions $f$ of $G$. In this paper we study the total Roman domination number of the lexicographic product of graphs. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Elsevier | es_ES |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.source | Discrete Applied Mathematics - 2019, Vol. 263 pp. 88-95 | es_ES |
| dc.subject | Total Roman domination | es_ES |
| dc.subject | Roman domination | es_ES |
| dc.subject | Lexicographic product graphs | es_ES |
| dc.title | Total Roman domination in the lexicographic product of graphs | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.1016/j.dam.2018.06.008 | |
| dc.type.hasVersion | AM | es_ES |