Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs

Article type: Research Article

Authors: Cabrera Martínez, A.^{; *} | García-Gómez, C. | Rodríguez-Velázquez, J. A.

Affiliations: Universitat Rovira i Virgili, Departament d’Enginyeria Informàtica i Matemàtiques, Av. Països Catalans 26, 43007 Tarragona, Spain. abel.cabrera@urv.cat, carlos.garciag@urv.cat, juanalberto.rodriguez@urv.cat

Correspondence: [*] Address for correspondence: Universitat Rovira i Virgili, Departament d’Enginyeria Informàtica i Matemàtiques, Av. Països Catalans 26, 43007 Tarragona, Spain.

Abstract: The aim of this paper is to obtain closed formulas for the perfect domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs. We show that these formulas can be obtained relatively easily for the case of the first two parameters. The picture is quite different when it concerns the perfect Roman domination number. In this case, we obtain general bounds and then we give sufficient and/or necessary conditions for the bounds to be achieved. We also discuss the case of perfect Roman graphs and we characterize the lexicographic product graphs where the perfect Roman domination number equals the Roman domination number.

Keywords: Roman domination, perfect domination, perfect Roman domination, lexicographic product

DOI: 10.3233/FI-222108

Journal: Fundamenta Informaticae, vol. 185, no. 3, pp. 201-220, 2022