Mostrar el registro sencillo del ítem

dc.contributor.authorValenzuela Tripodoro, Juan Carlos 
dc.contributor.authorMateos Camacho, María Antonia 
dc.contributor.authorCera López, Martín
dc.contributor.authorÁlvarez Ruiz, María del Pilar 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2026-05-13T09:32:27Z
dc.date.available2026-05-13T09:32:27Z
dc.date.issued2026-05-01
dc.identifier.issn2227-7390
dc.identifier.urihttp://hdl.handle.net/10498/39588
dc.description.abstractMotivated by the original idea of defending the Roman Empire, all these domination concepts can be interpreted as vertex-labeling schemes that model the allocation of resources to protect a graph against attacks. A Roman dominating function (RDF) is a labeling of the vertices of a graph with labels in {0, 1, 2} such that every vertex labeled 0 is adjacent to at least one vertex labeled 2. The weight of an RDF is the sum of all vertex labels. Vertices labeled 2 are intended to protect their neighbors labeled 0. The Roman domination number is the minimum weight of an RDF on the graph. In 2017, Álvarez et al. introduced strong Roman domination as a variant of Roman domination designed to protect the vertices of a graph against multiple simultaneous attacks. In 2021, Ahangar et al. defined [k]-Roman domination, another model intended to defend a graph against individual attacks on vertices. In this paper, we investigate the computational complexity of the associated decision problems for [k]-Roman domination and strong Roman domination. Furthermore, we determine exact values of these parameters for several graph families under both variants.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherMDPIes_ES
dc.rightsAttribution 4.0 Internacional
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.sourceMathematics 2026, 14(9), 1535es_ES
dc.subjectRoman dominationes_ES
dc.subjecttriple Roman dominationes_ES
dc.subjectstrong Roman dominationes_ES
dc.subject[k]-Roman dominationes_ES
dc.titleComplexity and Exact Values for [k]-Roman and Strong Roman Domination for Specific Graph Familieses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.3390/math14091535
dc.type.hasVersionVoRes_ES


Ficheros en el ítem

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

Mostrar el registro sencillo del ítem

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