Author, as appears in the article.: Cabrera Martinez, Abel; Cabrera Garcia, Suitberto; Rodriguez-Velazquez, J A
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: CABRERA MARTÍNEZ, ABEL / Rodríguez Velázquez, Juan Alberto
Keywords: Total roman {2}-domination Total roman domination Total domination Number Lexicographic product Double domination
Abstract: © 2020 Elsevier B.V. In a graph G, a vertex dominates itself and its neighbours. A subset S⊆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∘H in terms of invariants of the factor graphs G and H.
Thematic Areas: Mathematics, applied Matemática / probabilidade e estatística Linguística e literatura Interdisciplinar Ensino Engenharias iv Engenharias iii Engenharias i Discrete mathematics and combinatorics Ciências biológicas i Ciência da computação Applied mathematics
licence for use: https://creativecommons.org/licenses/by/3.0/es/
ISSN: 0166-218X
Author's mail: juanalberto.rodriguez@urv.cat
Author identifier: 0000-0002-9082-7647
Record's date: 2025-02-18
Paper version: info:eu-repo/semantics/acceptedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Paper original source: Discrete Applied Mathematics. 284 290-300
APA: Cabrera Martinez, Abel; Cabrera Garcia, Suitberto; Rodriguez-Velazquez, J A (2020). Double domination in lexicographic product graphs. Discrete Applied Mathematics, 284(), 290-300. DOI: 10.1016/j.dam.2020.03.045
Entity: Universitat Rovira i Virgili
Journal publication year: 2020
Publication Type: Journal Publications
Repositori URV