Sergio Bermudo

Roslan Hasni

Fateme Movahedi

Juan E. Nápoles Valdés

Discret. Appl. Math., March, 2024

2023

An iterated greedy algorithm for finding the minimum dominating set in graphs.

[BibT_eX]

[DOI]

Math. Comput. Simul., May, 2023

Upper bound for the geometric-arithmetic index of trees with given domination number.

[BibT_eX]

[DOI]

Discret. Math., 2023

2022

The differential of the line graph L(G).

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

The adjacency dimension of graphs.

[BibT_eX]

[DOI]

Juan A. Rodríguez-Velázquez

José M. Rodríguez

Ars Math. Contemp., 2022

Vertex-degree-based topological indices of oriented trees.

[BibT_eX]

[DOI]

Roberto Cruz

Juan Rada

Appl. Math. Comput., 2022

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs.

[BibT_eX]

[DOI]

Alejandra Casado

Ana Dolores López-Sánchez

Jesús Sánchez-Oro

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

Topological Indices and f-Polynomials on Some Graph Products.

[BibT_eX]

[DOI]

Symmetry, 2021

Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number.

[BibT_eX]

[DOI]

Magda Dettlaff

Magdalena Lemanska

Discret. Appl. Math., 2021

General Properties on Differential Sets of a Graph.

[BibT_eX]

[DOI]

Ludwin A. Basilio

Axioms, 2021

2020

Extremal trees for the Randić index with given domination number.

[BibT_eX]

[DOI]

Juan E. Nápoles Valdés

Juan Rada

Appl. Math. Comput., 2020

Domination in hexagonal chains.

[BibT_eX]

[DOI]

Robinson A. Higuita

Juan Rada

Appl. Math. Comput., 2020

2019

On the global total k-domination number of graphs.

[BibT_eX]

[DOI]

Frank Angel Hernández Mira

Abel Cabrera Martínez

Discret. Appl. Math., 2019

Total k-domination in strong product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On the total k-domination in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

2017

β-Differential of a Graph.

[BibT_eX]

[DOI]

Symmetry, 2017

Total k-domination in Cartesian product graphs.

[BibT_eX]

[DOI]

J. L. Sanchéz

Period. Math. Hung., 2017

On the differential and Roman domination number of a graph with minimum degree two.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Small values of the hyperbolicity constant in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Combinatorics for smaller kernels: The differential of a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The differential of the strong product graphs.

[BibT_eX]

[DOI]

L. De la Torre

A. M. Martín-Caraballo

Int. J. Comput. Math., 2015

2014

Graphs with small hyperbolicity constant.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

Relations between the differential and parameters in graphs.

[BibT_eX]

[DOI]

José M. Rodríguez

Electron. Notes Discret. Math., 2014

Computing the differential of a graph: Hardness, approximability and exact algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Gromov hyperbolic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Alliance free sets in Cartesian product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Lower bounds on the differential of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Partitioning a graph into offensive k-alliances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Computing the hyperbolicity constant.

[BibT_eX]

[DOI]

José M. Rodríguez

Comput. Math. Appl., 2011

Hyperbolicity and complement of graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Computing the differential of a graph.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On geodetic and k-geodetic sets in graphs.

[BibT_eX]

Ars Comb., 2010

On global offensive k-alliances in graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2010

2009

On the complement graph and defensive k-alliances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On the Decomposition of Graphs into Offensive k-Alliances.

[BibT_eX]

[DOI]