Mostrar el registro sencillo del ítem
dc.contributor.author | Cabrera Martínez, Abel![]() |
es_ES |
dc.contributor.author | Cabrera García, Suitberto![]() |
es_ES |
dc.contributor.author | Carrión García, Andrés![]() |
es_ES |
dc.contributor.author | Grisales Del Rio, Angela María![]() |
es_ES |
dc.date.accessioned | 2021-05-25T03:32:26Z | |
dc.date.available | 2021-05-25T03:32:26Z | |
dc.date.issued | 2020-11 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/166744 | |
dc.description.abstract | [EN] Let G be a graph with no isolated vertex and f:V(G)->{0,1,2} a function. Let V-i={v is an element of V(G):f(v)=i} for every i is an element of{0,1,2}. The function f is an outer-independent Roman dominating function on G if V0 is an independent set and every vertex in V-0 is adjacent to at least one vertex in V-2. The minimum weight omega(f)= Sigma v is an element of V(G)f(v) among all outer-independent Roman dominating functions f on G is the outer-independent Roman domination number of G. This paper is devoted to the study of the outer-independent Roman domination number of a graph, and it is a contribution to the special issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry. In particular, we obtain new tight bounds for this parameter, and some of them improve some well-known results. We also provide closed formulas for the outer-independent Roman domination number of rooted product graphs. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | MDPI AG | es_ES |
dc.relation.ispartof | Symmetry (Basel) | es_ES |
dc.rights | Reconocimiento (by) | es_ES |
dc.subject | Outer-independent Roman domination | es_ES |
dc.subject | Roman domination | es_ES |
dc.subject | Vertex cover | es_ES |
dc.subject | Rooted product graph | es_ES |
dc.subject.classification | ESTADISTICA E INVESTIGACION OPERATIVA | es_ES |
dc.title | On the Outer-Independent Roman Domination in Graphs | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.3390/sym12111846 | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat | es_ES |
dc.description.bibliographicCitation | Cabrera Martínez, A.; Cabrera García, S.; Carrión García, A.; Grisales Del Rio, AM. (2020). On the Outer-Independent Roman Domination in Graphs. Symmetry (Basel). 12(11):1-12. https://doi.org/10.3390/sym12111846 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.3390/sym12111846 | es_ES |
dc.description.upvformatpinicio | 1 | es_ES |
dc.description.upvformatpfin | 12 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 12 | es_ES |
dc.description.issue | 11 | es_ES |
dc.identifier.eissn | 2073-8994 | es_ES |
dc.relation.pasarela | S\422037 | es_ES |
dc.description.references | Goddard, W., & Henning, M. A. (2013). Independent domination in graphs: A survey and recent results. Discrete Mathematics, 313(7), 839-854. doi:10.1016/j.disc.2012.11.031 | es_ES |
dc.description.references | Cockayne, E. J., Dreyer, P. A., Hedetniemi, S. M., & Hedetniemi, S. T. (2004). Roman domination in graphs. Discrete Mathematics, 278(1-3), 11-22. doi:10.1016/j.disc.2003.06.004 | es_ES |
dc.description.references | Abdollahzadeh Ahangar, H., Chellali, M., & Samodivkin, V. (2017). Outer independent Roman dominating functions in graphs. International Journal of Computer Mathematics, 94(12), 2547-2557. doi:10.1080/00207160.2017.1301437 | es_ES |
dc.description.references | Cabrera Martínez, A., Kuziak, D., & Yero, G. I. (2021). A constructive characterization of vertex cover Roman trees. Discussiones Mathematicae Graph Theory, 41(1), 267. doi:10.7151/dmgt.2179 | es_ES |
dc.description.references | Godsil, C. D., & McKay, B. D. (1978). A new graph product and its spectrum. Bulletin of the Australian Mathematical Society, 18(1), 21-28. doi:10.1017/s0004972700007760 | es_ES |