- -

Double domination in lexicographic product graphs

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Double domination in lexicographic product graphs

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: Cabrera;Cabrera;R ...
Tamaño: 413.2Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Cabrera Martínez, Abel es_ES
dc.contributor.author Cabrera García, Suitberto es_ES
dc.contributor.author Rodríguez-Velázquez, J.A. es_ES
dc.date.accessioned 2021-05-14T03:32:02Z
dc.date.available 2021-05-14T03:32:02Z
dc.date.issued 2020-09-30 es_ES
dc.identifier.issn 0166-218X es_ES
dc.identifier.uri http://hdl.handle.net/10251/166349
dc.description.abstract [EN] In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G o H in terms of invariants of the factor graphs G and H. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Discrete Applied Mathematics es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Double domination es_ES
dc.subject Total domination es_ES
dc.subject Total Roman {2}-domination es_ES
dc.subject Lexicographic product es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Double domination in lexicographic product graphs es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.dam.2020.03.045 es_ES
dc.rights.accessRights Cerrado 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.; Rodríguez-Velázquez, J. (2020). Double domination in lexicographic product graphs. Discrete Applied Mathematics. 284:290-300. https://doi.org/10.1016/j.dam.2020.03.045 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.dam.2020.03.045 es_ES
dc.description.upvformatpinicio 290 es_ES
dc.description.upvformatpfin 300 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 284 es_ES
dc.relation.pasarela S\417127 es_ES
dc.description.references Ahangar Abdollahzadeh, H., Henning, M., Samodivkin, V., & Yero, I. (2016). Total Roman domination in graphs. Applicable Analysis and Discrete Mathematics, 10(2), 501-517. doi:10.2298/aadm160802017a es_ES
dc.description.references Amjadi, J., Sheikholeslami, S. M., & Soroudi, M. (2019). On the total Roman domination in trees. Discussiones Mathematicae Graph Theory, 39(2), 519. doi:10.7151/dmgt.2099 es_ES
dc.description.references Cabrera Martínez, A., Cabrera García, S., & Carrión García, A. (2020). Further Results on the Total Roman Domination in Graphs. Mathematics, 8(3), 349. doi:10.3390/math8030349 es_ES
dc.description.references A. Cabrera Martínez, J.A. Rodríguez-Velázquez, Total protection of lexicographic product graphs, Discuss. Math. Graph Theory, in press. es_ES
dc.description.references Campanelli, N., & Kuziak, D. (2019). Total Roman domination in the lexicographic product of graphs. Discrete Applied Mathematics, 263, 88-95. doi:10.1016/j.dam.2018.06.008 es_ES
dc.description.references Cockayne, E. J., Dawes, R. M., & Hedetniemi, S. T. (1980). Total domination in graphs. Networks, 10(3), 211-219. doi:10.1002/net.3230100304 es_ES
dc.description.references Dettlaff, M., Lemańska, M., Rodríguez-Velázquez, J. A., & Zuazua, R. (2019). On the super domination number of lexicographic product graphs. Discrete Applied Mathematics, 263, 118-129. doi:10.1016/j.dam.2018.03.082 es_ES
dc.description.references Dorbec, P., Mollard, M., Klavžar, S., & Špacapan, S. (2008). Power Domination in Product Graphs. SIAM Journal on Discrete Mathematics, 22(2), 554-567. doi:10.1137/060661879 es_ES
dc.description.references Hajian, M., & Rad, N. J. (2019). A new lower bound on the double domination number of a graph. Discrete Applied Mathematics, 254, 280-282. doi:10.1016/j.dam.2018.06.009 es_ES
dc.description.references Harant, J., & Henning, M. . A. (2005). On Double Domination in Graphs. Discussiones Mathematicae Graph Theory, 25(1-2), 29. doi:10.7151/dmgt.1256 es_ES
dc.description.references Chellali, M., & Khelifi, S. (2012). Double domination critical and stable graphs upon vertex removal. Discussiones Mathematicae Graph Theory, 32(4), 643. doi:10.7151/dmgt.1633 es_ES
dc.description.references Liu, C.-H., & Chang, G. J. (2012). Roman domination on strongly chordal graphs. Journal of Combinatorial Optimization, 26(3), 608-619. doi:10.1007/s10878-012-9482-y es_ES
dc.description.references Nowakowski, R. J., & Rall, D. F. (1996). Associative graph products and their independence, domination and coloring numbers. Discussiones Mathematicae Graph Theory, 16(1), 53. doi:10.7151/dmgt.1023 es_ES
dc.description.references Šumenjak, T. K., Rall, D. F., & Tepeh, A. (2013). Rainbow domination in the lexicographic product of graphs. Discrete Applied Mathematics, 161(13-14), 2133-2141. doi:10.1016/j.dam.2013.03.011 es_ES
dc.description.references Šumenjak, T. K., Pavlič, P., & Tepeh, A. (2012). On the Roman domination in the lexicographic product of graphs. Discrete Applied Mathematics, 160(13-14), 2030-2036. doi:10.1016/j.dam.2012.04.008 es_ES
dc.description.references Valveny, M., Pérez-Rosés, H., & Rodríguez-Velázquez, J. A. (2019). On the weak Roman domination number of lexicographic product graphs. Discrete Applied Mathematics, 263, 257-270. doi:10.1016/j.dam.2018.03.039 es_ES


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

Mostrar el registro sencillo del ítem