On the Decomposition of Graphs into Offensive k-Alliances. - José M. Sigarreta Almira; Ismael González Yero; Sergio Bermudo; Juan Alberto Rodríguez-Velázquez (CTW, 2009)

On the complement graph and defensive k-alliances. - José María Sigarreta; Sergio Bermudo; Henning Fernau (Discret. Appl. Math., 2009)

On global offensive k-alliances in graphs. - Sergio Bermudo; Juan Alberto Rodríguez-Velázquez; José M. Sigarreta Almira; Ismael González Yero (Appl. Math. Lett., 2010)

On geodetic and k-geodetic sets in graphs. - Sergio Bermudo; Juan Alberto Rodríguez-Velázquez; José M. Sigarreta Almira; Ismael González Yero (Ars Comb., 2010)

Computing the differential of a graph. - Sergio Bermudo; Henning Fernau (CTW, 2011)

Hyperbolicity and complement of graphs. - Sergio Bermudo; José M. Rodríguez 001; José María Sigarreta; Eva Tourís (Appl. Math. Lett., 2011)

Computing the hyperbolicity constant. - Sergio Bermudo; José M. Rodríguez 001; José María Sigarreta (Comput. Math. Appl., 2011)

Partitioning a graph into offensive k-alliances. - José M. Sigarreta Almira; Ismael González Yero; Sergio Bermudo; Juan Alberto Rodríguez-Velázquez (Discret. Appl. Math., 2011)

Lower bounds on the differential of a graph. - Sergio Bermudo; Henning Fernau (Discret. Math., 2012)

Alliance free sets in Cartesian product graphs. - Ismael González Yero; Juan Alberto Rodríguez-Velázquez; Sergio Bermudo (Discret. Appl. Math., 2013)

Gromov hyperbolic graphs. - Sergio Bermudo; José M. Rodríguez 001; José María Sigarreta; Jean-Marie Vilaire (Discret. Math., 2013)

Computing the differential of a graph: Hardness, approximability and exact algorithms. - Sergio Bermudo; Henning Fernau (Discret. Appl. Math., 2014)

Relations between the differential and parameters in graphs. - Sergio Bermudo; Juan Carlos Hernández-Gómez; José M. Rodríguez 001; José María Sigarreta (Electron. Notes Discret. Math., 2014)

Graphs with small hyperbolicity constant. - Sergio Bermudo; José M. Rodríguez 001; Omar Rosario; José María Sigarreta (Electron. Notes Discret. Math., 2014)

The differential of the strong product graphs. - Sergio Bermudo; L. De la Torre; A. M. Martín-Caraballo; José María Sigarreta (Int. J. Comput. Math., 2015)

Combinatorics for smaller kernels: The differential of a graph. - Sergio Bermudo; Henning Fernau (Theor. Comput. Sci., 2015)

Small values of the hyperbolicity constant in graphs. - Sergio Bermudo; José M. Rodríguez 001; Omar Rosario; José María Sigarreta (Discret. Math., 2016)

On the differential and Roman domination number of a graph with minimum degree two. - Sergio Bermudo (Discret. Appl. Math., 2017)

Total k-domination in Cartesian product graphs. - Sergio Bermudo; J. L. Sanchéz; José María Sigarreta (Period. Math. Hung., 2017)

β-Differential of a Graph. - Ludwin A. Basilio; Sergio Bermudo; Jesús Leaños; José María Sigarreta (Symmetry, 2017)

On the total k-domination in graphs. - Sergio Bermudo; Juan Carlos Hernández-Gómez; José María Sigarreta (Discuss. Math. Graph Theory, 2018)

Total k-domination in strong product graphs. - Sergio Bermudo; Juan Carlos Hernández-Gómez; José María Sigarreta (Discret. Appl. Math., 2019)

On the global total k-domination number of graphs. - Sergio Bermudo; Abel Cabrera Martínez; Frank Angel Hernández Mira; José María Sigarreta (Discret. Appl. Math., 2019)

Domination in hexagonal chains. - Sergio Bermudo; Robinson A. Higuita; Juan Rada (Appl. Math. Comput., 2020)

Extremal trees for the Randić index with given domination number. - Sergio Bermudo; Juan Eduardo Nápoles Valdés; Juan Rada (Appl. Math. Comput., 2020)

General Properties on Differential Sets of a Graph. - Ludwin A. Basilio; Sergio Bermudo; Juan Carlos Hernández-Gómez; José María Sigarreta (Axioms, 2021)

Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. - Sergio Bermudo; Magda Dettlaff; Magdalena Lemanska (Discret. Appl. Math., 2021)

Topological Indices and f-Polynomials on Some Graph Products. - Ricardo Abreu Blaya; Sergio Bermudo; José M. Rodríguez 001; Eva Tourís (Symmetry, 2021)

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs. - Alejandra Casado; Sergio Bermudo; Ana Dolores López-Sánchez; Jesús Sánchez-Oro (MIC, 2022)

Vertex-degree-based topological indices of oriented trees. - Sergio Bermudo; Roberto Cruz; Juan Rada (Appl. Math. Comput., 2022)

The adjacency dimension of graphs. - Sergio Bermudo; José M. Rodríguez 001; Juan A. Rodríguez-Velázquez; José María Sigarreta (Ars Math. Contemp., 2022)

The differential of the line graph L(G). - Ludwin A. Basilio; Sergio Bermudo; Jesús Leaños; José María Sigarreta (Discret. Appl. Math., 2022)

Upper bound for the geometric-arithmetic index of trees with given domination number. - Sergio Bermudo (Discret. Math., 2023)

An iterated greedy algorithm for finding the minimum dominating set in graphs. - Alejandra Casado; Sergio Bermudo; A. D. López-Sánchez; Jesús Sánchez-Oro (Math. Comput. Simul., 2023)

The Geometric-Arithmetic index of trees with a given total domination number. - Sergio Bermudo; Roslan Hasni; Fateme Movahedi; Juan Eduardo Nápoles Valdés (Discret. Appl. Math., 2024)

Finding the minimum k-weighted dominating sets using heuristic algorithms. - Eva Barrena; Sergio Bermudo; A. G. Hernández-Díaz; A. D. López-Sánchez; José A. Zamudio (Math. Comput. Simul., 2025)

Vertex-degree function index on oriented graphs. - Sergio Bermudo; Roberto Cruz; Juan Rada (Comput. Appl. Math., 2025)

Domination number of modular product graphs. - Sergio Bermudo; Iztok Peterin; Jelena Sedlar; Riste Skrekovski (Comput. Appl. Math., 2025)