default search action
Sergio Bermudo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j33]Eva Barrena
, Sergio Bermudo, A. G. Hernández-Díaz, A. D. López-Sánchez
Finding the minimum k-weighted dominating sets using heuristic algorithms. Math. Comput. Simul. 228: 485-497 (2025) - 2024
- [j32]Sergio Bermudo, Roslan Hasni, Fateme Movahedi, Juan E. Nápoles Valdés:
The Geometric-Arithmetic index of trees with a given total domination number. Discret. Appl. Math. 345: 99-113 (2024) - 2023
- [j31]Sergio Bermudo
Upper bound for the geometric-arithmetic index of trees with given domination number. Discret. Math. 346(1): 113172 (2023) - [j30]Alejandra Casado, Sergio Bermudo
An iterated greedy algorithm for finding the minimum dominating set in graphs. Math. Comput. Simul. 207: 41-58 (2023) - 2022
- [j29]Sergio Bermudo
Vertex-degree-based topological indices of oriented trees. Appl. Math. Comput. 433: 127395 (2022) - [j28]Sergio Bermudo
The adjacency dimension of graphs. Ars Math. Contemp. 22(3): 3 (2022) - [j27]Ludwin A. Basilio
The differential of the line graph L(G). Discret. Appl. Math. 321: 82-89 (2022) - [c3]Alejandra Casado
A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs. MIC 2022: 554-559 - 2021
- [j26]Ludwin A. Basilio, Sergio Bermudo
General Properties on Differential Sets of a Graph. Axioms 10(4): 265 (2021) - [j25]Sergio Bermudo
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. Discret. Appl. Math. 304: 153-163 (2021) - [j24]Ricardo Abreu Blaya, Sergio Bermudo
Topological Indices and f-Polynomials on Some Graph Products. Symmetry 13(2): 292 (2021) - 2020
- [j23]Sergio Bermudo
Domination in hexagonal chains. Appl. Math. Comput. 369 (2020) - [j22]Sergio Bermudo
Extremal trees for the Randić index with given domination number. Appl. Math. Comput. 375: 125122 (2020)
2010 – 2019
- 2019
- [j21]Sergio Bermudo
On the global total k-domination number of graphs. Discret. Appl. Math. 263: 42-50 (2019) - [j20]Sergio Bermudo
Total k-domination in strong product graphs. Discret. Appl. Math. 263: 51-58 (2019) - 2018
- [j19]Sergio Bermudo
On the total k-domination in graphs. Discuss. Math. Graph Theory 38(1): 301-317 (2018) - 2017
- [j18]Sergio Bermudo
On the differential and Roman domination number of a graph with minimum degree two. Discret. Appl. Math. 232: 64-72 (2017) - [j17]Sergio Bermudo
Total k-domination in Cartesian product graphs. Period. Math. Hung. 75(2): 255-267 (2017) - [j16]Ludwin A. Basilio, Sergio Bermudo
β-Differential of a Graph. Symmetry 9(10): 205 (2017) - 2016
- [j15]Sergio Bermudo
Small values of the hyperbolicity constant in graphs. Discret. Math. 339(12): 3073-3084 (2016) - 2015
- [j14]Sergio Bermudo
The differential of the strong product graphs. Int. J. Comput. Math. 92(6): 1124-1134 (2015) - [j13]Sergio Bermudo
Combinatorics for smaller kernels: The differential of a graph. Theor. Comput. Sci. 562: 330-345 (2015) - 2014
- [j12]Sergio Bermudo
Computing the differential of a graph: Hardness, approximability and exact algorithms. Discret. Appl. Math. 165: 69-82 (2014) - [j11]Sergio Bermudo
Graphs with small hyperbolicity constant. Electron. Notes Discret. Math. 46: 265-272 (2014) - [j10]Sergio Bermudo
Relations between the differential and parameters in graphs. Electron. Notes Discret. Math. 46: 281-288 (2014) - 2013
- [j9]Ismael González Yero
Alliance free sets in Cartesian product graphs. Discret. Appl. Math. 161(10-11): 1618-1625 (2013) - [j8]Sergio Bermudo
Gromov hyperbolic graphs. Discret. Math. 313(15): 1575-1585 (2013) - 2012
- [j7]Sergio Bermudo
Lower bounds on the differential of a graph. Discret. Math. 312(22): 3236-3250 (2012) - 2011
- [j6]Sergio Bermudo
Hyperbolicity and complement of graphs. Appl. Math. Lett. 24(11): 1882-1887 (2011) - [j5]Sergio Bermudo
Computing the hyperbolicity constant. Comput. Math. Appl. 62(12): 4592-4595 (2011) - [j4]José M. Sigarreta Almira
Partitioning a graph into offensive k-alliances. Discret. Appl. Math. 159(4): 224-231 (2011) - [c2]Sergio Bermudo, Henning Fernau:
Computing the differential of a graph. CTW 2011: 68-71 - 2010
- [j3]Sergio Bermudo
On global offensive k-alliances in graphs. Appl. Math. Lett. 23(12): 1454-1458 (2010) - [j2]Sergio Bermudo, Juan Alberto Rodríguez-Velázquez, José M. Sigarreta Almira, Ismael González Yero:
On geodetic and k-geodetic sets in graphs. Ars Comb. 96 (2010)
2000 – 2009
- 2009
- [j1]José María Sigarreta
On the complement graph and defensive k-alliances. Discret. Appl. Math. 157(8): 1687-1695 (2009) - [c1]José M. Sigarreta Almira, Ismael González Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velázquez:
On the Decomposition of Graphs into Offensive k-Alliances. CTW 2009: 297-300
Coauthor Index
aka: José M. Sigarreta Almira
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: