Author, as appears in the article.: Hernandez-Ortiz, R; Montejano, L P; Rodriguez-Velazquez, J A
Department: Química Física i Inorgànica
URV's Author/s: Hernández Ortiz, Rangel / Montejano Cantoral, Luis Pedro / Rodríguez Velázquez, Juan Alberto
Keywords: Rooted product graphs Np-hard problem Italian domination
Abstract: © 2020, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. In this article, we obtain closed formulae for the Italian domination number of rooted product graphs. As a particular case of the study, we derive the corresponding formulas for corona graphs, and we provide an alternative proof that the problem of computing the Italian domination number of a graph is NP-hard.
Thematic Areas: Mathematics (miscellaneous) Mathematics (all) Mathematics General mathematics
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: luispedro.montejano@urv.cat juanalberto.rodriguez@urv.cat
Author identifier: 0000-0002-9082-7647
Record's date: 2024-10-26
Papper version: info:eu-repo/semantics/acceptedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Bulletin Of The Malaysian Mathematical Sciences Society. 44 (1): 497-508
APA: Hernandez-Ortiz, R; Montejano, L P; Rodriguez-Velazquez, J A (2021). Italian Domination in Rooted Product Graphs. Bulletin Of The Malaysian Mathematical Sciences Society, 44(1), 497-508. DOI: 10.1007/s40840-020-00962-3
Entity: Universitat Rovira i Virgili
Journal publication year: 2021
Publication Type: Journal Publications
Repositori URV