default search action
Ismael González Yero
Ismael G. Yero
Person information
- affiliation: University of Cádiz, Algeciras, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j84]Venkata Subba Reddy Palagiri, Guru Pratap Sharma, Ismael G. Yero:
Complexity issues concerning the quadruple Roman domination problem in graphs. Theor. Comput. Sci. 1026: 115013 (2025) - 2024
- [j83]Bostjan Bresar
, Ismael G. Yero
Lower (total) mutual-visibility number in graphs. Appl. Math. Comput. 465: 128411 (2024) - [j82]Iztok Peterin, Jelena Sedlar
Resolving vertices of graphs with differences. Comput. Appl. Math. 43(5): 275 (2024) - [j81]Anni Hakanen
On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discret. Appl. Math. 353: 191-207 (2024) - [j80]Serafino Cicerone, Gabriele Di Stefano
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358: 136-146 (2024) - [j79]M. Alfred Raju
On the total version of the covering Italian domination problem. Discret. Appl. Math. 358: 333-343 (2024) - [j78]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120: 103995 (2024) - [j77]Anni Hakanen, Ismael G. Yero:
Complexity and Equivalency of Multiset Dimension and ID-colorings. Fundam. Informaticae 191(3-4): 315-330 (2024) - [i7]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. CoRR abs/2401.02373 (2024) - 2023
- [j76]Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Global offensive k-alliances in digraphs. Bull. ICA 97: 67-82 (2023) - [j75]Bostjan Bresar
Injective coloring of graphs revisited. Discret. Math. 346(5): 113348 (2023) - [j74]Serafino Cicerone
Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974: 114096 (2023) - [i6]Anni Hakanen
Complexity and equivalency of multiset dimension and ID-colorings. CoRR abs/2303.06986 (2023) - [i5]Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero:
Variety of mutual-visibility problems in graphs. CoRR abs/2304.00864 (2023) - 2022
- [j73]Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
On metric dimensions of hypercubes. Ars Math. Contemp. 23(2) (2022) - [j72]Anni Hakanen
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319: 407-423 (2022) - [j71]Martin Knor
A note on the metric and edge metric dimensions of 2-connected graphs. Discret. Appl. Math. 319: 454-460 (2022) - [j70]Doost Ali Mojdeh
Further results on packing related parameters in graphs. Discuss. Math. Graph Theory 42(2): 333-348 (2022) - [j69]Dragana Bozovic, Aleksander Kelenc, Iztok Peterin
Incidence dimension and 2-packing number in graphs. RAIRO Oper. Res. 56(1): 199-211 (2022) - 2021
- [j68]Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. 401: 126076 (2021) - [j67]Sandi Klavzar, Douglas F. Rall
General d-position sets. Ars Math. Contemp. 21(1) (2021) - [j66]Sandi Klavzar
A Steiner general position problem in graph theory. Comput. Appl. Math. 40(6) (2021) - [j65]Alejandro Estrada-Moreno
On The (k, t)-Metric Dimension Of Graphs. Comput. J. 64(5): 707-720 (2021) - [j64]Doost Ali Mojdeh
On three outer-independent domination related parameters in graphs. Discret. Appl. Math. 294: 115-124 (2021) - [j63]Abdollah Khodkar, Doost Ali Mojdeh
Covering Italian domination in graphs. Discret. Appl. Math. 304: 324-331 (2021) - [j62]Abel Cabrera Martínez
Independent transversal total domination versus total domination in trees. Discuss. Math. Graph Theory 41(1): 213-224 (2021) - [j61]Abel Cabrera Martínez
A constructive characterization of vertex cover Roman trees. Discuss. Math. Graph Theory 41(1): 267-283 (2021) - 2020
- [j60]Abel Cabrera Martínez
Constructive characterizations concerning weak Roman domination in trees. Discret. Appl. Math. 284: 384-390 (2020) - [j59]Doost Ali Mojdeh, Iztok Peterin, Babak Samadi
(Open) packing number of some graph products. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j58]Doost Ali Mojdeh
Global defensive k-alliances in directed graphs: combinatorial and computational issues. RAIRO Oper. Res. 54(4): 1027-1040 (2020)
2010 – 2019
- 2019
- [j57]Reynaldo Gil Pons
Distance-based vertex identification in graphs: The outer multiset dimension. Appl. Math. Comput. 363 (2019) - [j56]Abel Cabrera Martínez
On Computational and Combinatorial Properties of the Total Co-independent Domination Number of Graphs. Comput. J. 62(1): 97-108 (2019) - [j55]Ismael González Yero
10th Andalusian Meeting on Discrete Mathematics. Discret. Appl. Math. 263: 1 (2019) - [j54]Abel Cabrera Martínez
Outer-independent total Roman domination in graphs. Discret. Appl. Math. 269: 107-119 (2019) - [j53]Doost Ali Mojdeh
Packing and domination parameters in digraphs. Discret. Appl. Math. 269: 184-192 (2019) - [j52]Robert Bailey, Ismael González Yero
Error-correcting codes from k-resolving sets. Discuss. Math. Graph Theory 39(2): 341-355 (2019) - [j51]Bhaskar DasGupta
On analyzing and evaluating privacy measures for social networks under active attack. Inf. Sci. 473: 87-100 (2019) - [j50]Iztok Peterin
Efficient closed domination in digraph products. J. Comb. Optim. 38(1): 130-149 (2019) - [j49]Tanima Chatterjee, Bhaskar DasGupta
On the computational complexities of three problems related to a privacy measure for large networks under active attack. Theor. Comput. Sci. 775: 53-67 (2019) - 2018
- [j48]Dorota Kuziak
Strong resolving graphs: The realization and the characterization problems. Discret. Appl. Math. 236: 270-287 (2018) - [j47]Cong X. Kang, Ismael González Yero
The fractional strong metric dimension in three graph products. Discret. Appl. Math. 251: 190-203 (2018) - [j46]Aleksander Kelenc, Niko Tratnik
Uniquely identifying the edges of a graph: The edge metric dimension. Discret. Appl. Math. 251: 204-220 (2018) - [j45]Dorota Kuziak
Bounding the open k-monopoly number of strong product graphs. Discuss. Math. Graph Theory 38(1): 287-299 (2018) - [i4]Bhaskar DasGupta, Nasim Mobasheri, Ismael González Yero:
On analyzing and evaluating privacy measures for social networks under active attack. CoRR abs/1809.05926 (2018) - 2017
- [j44]Hossein Abdollahzadeh Ahangar, M. Najimi, Vladimir Samodivkin
The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity. AKCE Int. J. Graphs Comb. 14(3): 242-250 (2017) - [j43]Ismael González Yero
Computing the k-metric dimension of graphs. Appl. Math. Comput. 300: 60-69 (2017) - [j42]Aleksander Kelenc, Dorota Kuziak
Mixed metric dimension of graphs. Appl. Math. Comput. 314: 429-438 (2017) - [j41]Sandi Klavzar
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. 217: 613-621 (2017) - [j40]Abel Cabrera Martínez
On the independence transversal total domination number of graphs. Discret. Appl. Math. 219: 65-73 (2017) - [j39]M. P. Álvarez-Ruiz, T. Mediavilla-Gradolph, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela Tripodoro
On the strong Roman domination number of graphs. Discret. Appl. Math. 231: 44-59 (2017) - [j38]Dorota Kuziak
Computing the metric dimension of a graph from primary subgraphs. Discuss. Math. Graph Theory 37(1): 273-293 (2017) - [j37]Nicolás Campanelli, Ismael González Yero
On some resolving partitions for the lexicographic product of two graphs. Int. J. Comput. Math. 94(7): 1363-1374 (2017) - 2016
- [j36]Juan A. Rodríguez-Velázquez, Ismael González Yero, Dorota Kuziak:
The partition dimension of corona product graphs. Ars Comb. 127: 387-399 (2016) - [j35]Rolando Trujillo-Rasua
Characterizing 1-Metric Antidimensional Trees and Unicyclic Graphs. Comput. J. 59(8): 1264-1273 (2016) - [j34]Ismael González Yero
Strong resolving partitions for strong product graphs and Cartesian product graphs. Discret. Appl. Math. 202: 70-78 (2016) - [j33]Alejandro Estrada-Moreno
The k-metric dimension of the lexicographic product of graphs. Discret. Math. 339(7): 1924-1934 (2016) - [j32]Dorota Kuziak
Closed formulae for the strong metric dimension of lexicographic product graphs. Discuss. Math. Graph Theory 36(4): 1051-1064 (2016) - [j31]Dorota Kuziak
Open k-monopolies in graphs: complexity and related concepts. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j30]Ismael González Yero
Vertices, edges, distances and metric dimension in graphs. Electron. Notes Discret. Math. 55: 191-194 (2016) - [j29]Alejandro Estrada-Moreno
Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs. Graphs Comb. 32(6): 2367-2392 (2016) - [j28]Dorota Kuziak
Strong metric dimension of rooted product graphs. Int. J. Comput. Math. 93(8): 1265-1280 (2016) - [j27]Rolando Trujillo-Rasua
k-Metric antidimension: A privacy measure for social graphs. Inf. Sci. 328: 403-417 (2016) - [j26]Ismael González Yero
The security number of strong grid-like graphs. Theor. Comput. Sci. 653: 1-14 (2016) - [i3]Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael González Yero:
On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack. CoRR abs/1607.01438 (2016) - 2015
- [j25]Ismael González Yero
Partial product of graphs and Vizing's conjecture. Ars Math. Contemp. 9(1): 19-25 (2015) - [j24]Dorota Kuziak
On the Strong Metric Dimension of Cartesian Sum Graphs. Fundam. Informaticae 141(1): 57-69 (2015) - 2014
- [j23]Ismael González Yero:
On the Strong Partition Dimension of Graphs. Electron. J. Comb. 21(3): 3 (2014) - [j22]Juan Alberto Rodríguez-Velázquez
On the partition dimension of trees. Discret. Appl. Math. 166: 204-209 (2014) - [j21]Magda Dettlaff
Bondage number of grid graphs. Discret. Appl. Math. 167: 94-99 (2014) - [j20]Ismael González Yero
The partition dimension of strong product graphs and Cartesian product graphs. Discret. Math. 331: 43-52 (2014) - [j19]Juan Alberto Rodríguez-Velázquez
On the strong metric dimension of Cartesian and direct products of graphs. Discret. Math. 335: 8-19 (2014) - [j18]Dorota Kuziak
Efficient open domination in graph products. Discret. Math. Theor. Comput. Sci. 16(1): 105-120 (2014) - [j17]Juan Alberto Rodríguez-Velázquez
Preface. Electron. Notes Discret. Math. 46: 1-2 (2014) - [j16]Alejandro Estrada-Moreno
k-metric resolvability in graphs. Electron. Notes Discret. Math. 46: 121-128 (2014) - [j15]Dorota Kuziak
On the strong metric dimension of product graphs. Electron. Notes Discret. Math. 46: 169-176 (2014) - [i2]Rolando Trujillo-Rasua, Ismael González Yero:
k-Metric Antidimension: a Privacy Measure for Social Graphs. CoRR abs/1408.2154 (2014) - 2013
- [j14]Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
Boundary powerful k-alliances in graphs. Ars Comb. 111: 495-504 (2013) - [j13]Ismael González Yero
Computing global offensive alliances in Cartesian product graphs. Discret. Appl. Math. 161(1-2): 284-293 (2013) - [j12]Dorota Kuziak
On the strong metric dimension of corona product graphs and join graphs. Discret. Appl. Math. 161(7-8): 1022-1027 (2013) - [j11]Ismael González Yero
Alliance free sets in Cartesian product graphs. Discret. Appl. Math. 161(10-11): 1618-1625 (2013) - [j10]Ismael González Yero
On Clark and Suen bound-type results for k-domination and Roman domination of Cartesian product graphs. Int. J. Comput. Math. 90(3): 522-526 (2013) - [i1]Ismael González Yero, Amaurys Rondón Aguilar:
The double projection method for some domination related parameters in Cartesian product graphs. CTW 2013: 121-124 - 2012
- [j9]Ismael González Yero
Partitioning a Graph into Global Powerful k-Alliances. Graphs Comb. 28(4): 575-583 (2012) - [j8]Magdalena Lemanska
Nordhaus-Gaddum results for the convex domination number of a graph. Period. Math. Hung. 65(1): 125-134 (2012) - 2011
- [j7]Ismael González Yero
On the metric dimension of corona product graphs. Comput. Math. Appl. 61(9): 2793-2798 (2011) - [j6]José M. Sigarreta Almira
Partitioning a graph into offensive k-alliances. Discret. Appl. Math. 159(4): 224-231 (2011) - 2010
- [b1]Ismael González Yero:
Contribution to the study of alliances in graphs. University of Rovira i Virgili, Spain, 2010 - [j5]Ismael González Yero
A note on the partition dimension of Cartesian product graphs. Appl. Math. Comput. 217(7): 3571-3574 (2010) - [j4]Sergio Bermudo
On global offensive k-alliances in graphs. Appl. Math. Lett. 23(12): 1454-1458 (2010) - [j3]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) - [j2]Ismael González Yero
Boundary defensive k-alliances in graphs. Discret. Appl. Math. 158(11): 1205-1211 (2010) - [c2]Ismael González Yero, Juan Alberto Rodríguez-Velázquez, Magdalena Lemanska:
On the Partition Dimension of Cartesian Product Graphs. CTW 2010: 61-64
2000 – 2009
- 2009
- [j1]Juan Alberto Rodríguez-Velázquez
Defensive k-alliances in graphs. Appl. Math. Lett. 22(1): 96-100 (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
Juan A. Rodríguez-Velázquez
aka: Juan Alberto Rodríguez-Velázquez
aka: Juan Alberto Rodríguez-Velázquez
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-12-12 21:00 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: