most citedTotal Roman 2-domination in graphs

13 citations · 14 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

7 papers · 1 filter

math.CO2021

Roman domination in direct product graphs and rooted product graphs

Abel Cabrera Martinez, Iztok Peterin, Ismael G. Yero

Let be a graph with vertex set . A function is a Roman dominating function on if every vertex for which is adjacent…

math.CO2021

A note on double domination in graphs

Abel Cabrera Martinez, Juan A. Rodriguez-Velazquez

Recently, Haynes, Hedetniemi and Henning published the book Topics in Domination in Graphs, which comprises 16 contributions that present advanced topics in graph domination, featu…

math.CO202113 cited

Total Roman 2-domination in graphs

Suitberto Cabrera Garcia, Abel Cabrera Martinez, Frank A. Hernandez Mira +1

Given a graph , a function is a total Roman -dominating function if: (1) every vertex for which satisfies that $\sum_{u…

math.CO2020

From Italian domination in lexicographic product graphs to w-domination in graphs

A. Cabrera Martinez, A. Estrada-Moreno, J. A. Rodriguez-Velazquez

In this paper, we show that the Italian domination number of every lexicographic product graph can be expressed in terms of five different domination parameters of .…

math.CO2020

Double domination in lexicographic product graphs

A. Cabrera Martinez, S. Cabrera Garcia, J. A. Rodriguez-Velazquez

In a graph , a vertex dominates itself and its neighbours. A subset is said to be a double dominating set of if dominates every vertex of at least…

math.CO2020

Dominating the direct product of two graphs through total Roman strategies

Abel Cabrera Martinez, Dorota Kuziak, Iztok Peterin +1

Given a graph without isolated vertices, a total Roman dominating function for is a function such that every vertex with label 0 is adjacent…