Publicaciones (61) Publicaciones de Sergio Bermudo Navarrete

2025

  1. Finding the minimum k-weighted dominating sets using heuristic algorithms

    Mathematics and Computers in Simulation, Vol. 228, pp. 485-497

2024

  1. The Geometric–Arithmetic index of trees with a given total domination number

    Discrete Applied Mathematics, Vol. 345, pp. 99-113

2023

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

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

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

    Mathematics and Computers in Simulation, Vol. 207, pp. 41-58

  3. Total Domination on Tree Operators

    Mediterranean Journal of Mathematics, Vol. 20, Núm. 1

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

    Discrete Mathematics, Vol. 346, Núm. 1

2022

  1. The adjacency dimension of graphs

    Ars Mathematica Contemporanea, Vol. 22, Núm. 3

  2. The differential of the line graph L(G)

    Discrete Applied Mathematics, Vol. 321, pp. 82-89

  3. Vertex-degree-based topological indices of oriented trees

    Applied Mathematics and Computation, Vol. 433

  4. k-domination and total k-domination numbers in catacondensed hexagonal systems

    Mathematical Biosciences and Engineering, Vol. 19, Núm. 7, pp. 7138-7155

2020

  1. Domination in hexagonal chains

    Applied Mathematics and Computation, Vol. 369

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

    Applied Mathematics and Computation, Vol. 375

  3. On q-Hermite–Hadamard inequalities for general convex functions

    Acta Mathematica Hungarica, Vol. 162, Núm. 1, pp. 364-374

2019

  1. Is every graph the extremal value of a vertex–degree–based topological index?

    Match, Vol. 81, Núm. 2, pp. 315-323

  2. On the global total k-domination number of graphs

    Discrete Applied Mathematics, Vol. 263, pp. 42-50