Author, as appears in the article.: Ramezani, F; Rodriguez-Bazan, E D; Rodriguez-Velazquez, J A
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Rodríguez Velázquez, Juan Alberto
Keywords: Sierpiński graph Roman domination number Generalized sierpiński graph
Abstract: A map f : V → {0, 1, 2} is a Roman dominating function on a graph G = (V, E) if for every vertex v ∈ V with f (v) = 0, there exists a vertex∑ u, adjacent to v, such that f (u) = 2. The weight of a Roman dominating function is given by f (V) =u∈V f (u). The minimum weight among all Roman dominating functions on G is called the Roman domination number of G. In this article we study the Roman domination number of Generalized Sierpiński graphs S(G, t). More precisely, we obtain a general upper bound on the Roman domination number of S(G, t) and discuss the tightness of this bound. In particular, we focus on the cases in which the base graph G is a path, a cycle, a complete graph or a graph having exactly one universal vertex.
Thematic Areas: Mathematics, applied Mathematics (miscellaneous) Mathematics (all) Mathematics General mathematics Engenharias iii Economia Ciências agrárias i
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: juanalberto.rodriguez@urv.cat
Author identifier: 0000-0002-9082-7647
Record's date: 2024-10-26
Papper version: info:eu-repo/semantics/publishedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Filomat. 31 (20): 6515-6528
APA: Ramezani, F; Rodriguez-Bazan, E D; Rodriguez-Velazquez, J A (2017). On the Roman domination number of generalized Sierpiński graphs. Filomat, 31(20), 6515-6528. DOI: 10.2298/FIL1720515R
Entity: Universitat Rovira i Virgili
Journal publication year: 2017
Publication Type: Journal Publications
Repositori URV