Abel Cabrera Martínez

Orcid: 0000-0003-2806-4842

According to our database1, Abel Cabrera Martínez authored at least 32 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New Bounds for Three Outer-Independent Domination-Related Parameters in Cactus Graphs.
Axioms, March, 2024

An improved upper bound on the domination number of a tree.
Discret. Appl. Math., January, 2024

2023
Double domination in rooted product graphs.
Discret. Appl. Math., November, 2023

A new lower bound for the independent domination number of a tree.
RAIRO Oper. Res., July, 2023

Relating the total {2}-domination number with the total domination number of graphs.
Discret. Appl. Math., July, 2023

2022
Some new results on the <i>k</i>-tuple domination number of graphs.
RAIRO Oper. Res., September, 2022

Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs.
Fundam. Informaticae, 2022

Total protection of lexicographic product graphs.
Discuss. Math. Graph Theory, 2022

New bounds on the double domination number of trees.
Discret. Appl. Math., 2022

From Italian domination in lexicographic product graphs to w-domination in graphs.
Ars Math. Contemp., 2022

A note on the k-tuple domination number of graphs.
Ars Math. Contemp., 2022

2021
Total protection in graphs.
PhD thesis, 2021

Correction: Cabrera Martínez et al. On the Secure Total Domination Number of Graphs. Symmetry 2019, 11, 1165.
Symmetry, 2021

From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs.
Symmetry, 2021

From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs.
Symmetry, 2021

Independent transversal total domination versus total domination in trees.
Discuss. Math. Graph Theory, 2021

A constructive characterization of vertex cover Roman trees.
Discuss. Math. Graph Theory, 2021

A note on double domination in graphs.
Discret. Appl. Math., 2021

From (secure) w-domination in graphs to protection of lexicographic product graphs.
CoRR, 2021

Starred Italian domination in graphs.
Contributions Discret. Math., 2021

Closed formulas for the total Roman domination number of lexicographic product graphs.
Ars Math. Contemp., 2021

2020
Total Domination in Rooted Product Graphs.
Symmetry, 2020

On the Outer-Independent Roman Domination in Graphs.
Symmetry, 2020

Secure w-Domination in Graphs.
Symmetry, 2020

Constructive characterizations concerning weak Roman domination in trees.
Discret. Appl. Math., 2020

Double domination in lexicographic product graphs.
Discret. Appl. Math., 2020

2019
On the Secure Total Domination Number of Graphs.
Symmetry, 2019

Total Weak Roman Domination in Graphs.
Symmetry, 2019

Outer-independent total Roman domination in graphs.
Discret. Appl. Math., 2019

On the global total k-domination number of graphs.
Discret. Appl. Math., 2019

On Computational and Combinatorial Properties of the Total Co-independent Domination Number of Graphs.
Comput. J., 2019

2017
On the independence transversal total domination number of graphs.
Discret. Appl. Math., 2017


  Loading...