ROMAN DOMINATION IN CARTESIAN PRODUCT GRAPHS AND STRONG PRODUCT GRAPHS

Applicable Analysis and Discrete Mathematics

article

Ismael González Yero¹  Juan Alberto Rodríguez-Velázquez² 

[1] Departamento de Matem´aticas, Escuela Polit´ecnica Superior de Algeciras, Universidad de C´adiz;Departament d’Enginyeria Inform`atica i Matem`atiques, Universitat Rovira i Virgili

关键词: Domination number;    Roman domination number;    Cartesian product graphs;    strong product graphs;   

DOI  :  10.2298/AADM130813017G

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Beogradu * Elektrotehnicki Fakultet / University of Belgrade, Faculty of Electrical Engineering

【 摘 要 】

A map f : V → {0, 1, 2} is a Roman dominating function for G if for everyvertex v with f(v) = 0, there exists a vertex u, adjacent to v, with f(u) = 2.The weight of a Roman dominating function is f(V ) = Xu∈Vf(u). The minimum weight of a Roman dominating function on G is the Roman dominationnumber of G. In this paper we study the Roman domination number of Cartesian product graphs and strong product graphs.

【 授权许可】

Unknown