Mostrar el registro sencillo del ítem

dc.contributor.authorCampanelli, Nicolás
dc.contributor.authorKuziak, Dorota 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2024-02-08T14:38:33Z
dc.date.available2024-02-08T14:38:33Z
dc.date.issued2019-06-30
dc.identifier.issn0166-218X
dc.identifier.urihttp://hdl.handle.net/10498/30893
dc.description.abstractA 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.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceDiscrete Applied Mathematics - 2019, Vol. 263 pp. 88-95es_ES
dc.subjectTotal Roman dominationes_ES
dc.subjectRoman dominationes_ES
dc.subjectLexicographic product graphses_ES
dc.titleTotal Roman domination in the lexicographic product of graphses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/j.dam.2018.06.008
dc.type.hasVersionAMes_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional