Repositori institucional URV
Español Català English
TÍTULO:
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs - imarina:9296663

Autor/es de la URV:CABRERA MARTÍNEZ, ABEL / Montejano Cantoral, Luis Pedro / Rodríguez Velázquez, Juan Alberto
Autor según el artículo:Cabrera-Martinez, Abel; Montejano, Luis Pedro; Rodriguez-Velazquez, Juan Alberto
Direcció de correo del autor:luispedro.montejano@urv.cat
juanalberto.rodriguez@urv.cat
Identificador del autor:0000-0002-9082-7647
Año de publicación de la revista:2023
Tipo de publicación:Journal Publications
Referencia de l'ítem segons les normes APA:Cabrera-Martinez, Abel; Montejano, Luis Pedro; Rodriguez-Velazquez, Juan Alberto (2023). From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs. Bulletin Of The Malaysian Mathematical Sciences Society, 46(3), 109-. DOI: 10.1007/s40840-023-01502-5
Referencia al articulo segun fuente origial:Bulletin Of The Malaysian Mathematical Sciences Society. 46 (3): 109-
Resumen:A wide range of parameters of domination in graphs can be defined and studied through a common approach that was recently introduced in [https://doi.org/10.26493/1855-3974.2318.fb9] under the name of w-domination, where w= (w, w1, ⋯ , wl) is a vector of non-negative integers such that w≥ 1. Given a graph G, a function f: V(G) ⟶ { 0 , 1 , ⋯ , l} is said to be a w-dominating function if ∑ u∈N(v)f(u) ≥ wi for every vertex v with f(v) = i, where N(v) denotes the open neighbourhood of v∈ V(G). The weight of f is defined to be ω(f) = ∑ v∈V(G)f(v) , while the w-domination number of G, denoted by γw(G) , is defined as the minimum weight among all w-dominating functions on G. A wide range of well-known domination parameters can be defined and studied through this approach. For instance, among others, the vector w= (1 , 0) corresponds to the case of standard domination, w= (2 , 1) corresponds to double domination, w= (2 , 0 , 0) corresponds to Italian domination, w= (2 , 0 , 1) corresponds to quasi-total Italian domination, w= (2 , 1 , 1) corresponds to total Italian domination, w= (2 , 2 , 2) corresponds to total { 2 } -domination, while w= (k, k- 1 , ⋯ , 1 , 0) corresponds to { k} -domination. In this paper, we show that several domination parameters of lexicographic product graphs G∘ H are equal to γw(G) for some vector w∈ { 2 } × { 0 , 1 , 2 } l and l∈ { 2 , 3 }. The decision on whether the equality holds for a specific vector w will depend on the value of some domination parameters of H. In particular, we focus on quasi-total Italian domination, total Italian domination, 2-domination, double domination, total { 2 } -domination, and double total domination of lexicographic product graphs.
DOI del artículo:10.1007/s40840-023-01502-5
Enlace a la fuente original:https://link.springer.com/article/10.1007/s40840-023-01502-5
Versión del articulo depositado:info:eu-repo/semantics/publishedVersion
Acceso a la licencia de uso:https://creativecommons.org/licenses/by/3.0/es/
Departamento:Enginyeria Informàtica i Matemàtiques
URL Documento de licencia:https://repositori.urv.cat/ca/proteccio-de-dades/
Áreas temáticas:Mathematics (miscellaneous)
Mathematics (all)
Mathematics
General mathematics
Palabras clave:W-domination
Quasi-total italian domination
Lexicographic product graph
Double domination
2-domination
(total) italian domination
Entidad:Universitat Rovira i Virgili
Fecha de alta del registro:2024-10-26
Busca tu registro en:

Archivos desponibles
ArchivoDescripciónFormato
DocumentPrincipalDocumentPrincipalapplication/pdf

Información

© 2011 Universitat Rovira i Virgili