ORCID

Información ORCID de GONZALEZ YERO, ISMAEL

Biografía

Mi trabajo de investigación se centra en la teoría de grafos, específicamente en parámetros relacionados con distancias y dominación, y la teoría métrica de grafos, y sus aplicaciones en ciencia de la computación, con énfasis en la privacidad de redes sociales y la detección de comunidades en redes. Las principales contribuciones realizadas son las siguientes.\n1- Estudio de diversas propiedades de las alianzas en grafos, con el objetivo de su utilización en la detección de comunidades en redes. Se han encontrado numerosas propiedades matemáticas de las alianzas, su comportamiento en grafos producto, así como su relación con otros parámetros de grafos tales como conjuntos dominantes y monopolios.\n2- Estudio de propiedades métricas de grafos. Se han estudiado diversos tipos de métricas en grafos tales como la (k-)dimensión métrica, la dimensión métrica fuerte, la dimensión de partición, la dimensión métrica de aristas, la dimensión de multiconjuntos, y otros. En relación a cada uno de ellos, se han obtenido diversos resultados combinatorios, computacionales y algorítmicos sobre los mismos, su comportamiento en redes productos, así como su interrelación.\n3- Introducción y estudio de la k-antidimensión métrica en grafos, como base teórica fundamental de una nueva medida de privacidad en redes sociales. Se ha presentado esta nueva medida de privacidad y se han estudiado varias propiedades combinatorias y computacionales de la misma.

Educación

Ph. D. (DEIM)

Universitat Rovira i Virgili: Tarragona, Catalunya, España

01/10/2007 hasta 30/08/2011

Grade in Mathematics (Mathematics)

Universidad de Oriente: Santiago de Cuba, Santiago de Cuba, CU

01/09/1998 hasta 31/08/2003

Empleo

Profesor Titular de Universidad (Mathematics)

Universidad de Cádiz: Cádiz, Andalusia, España

22/03/2022

Profesor Contratado Doctor (Mathematics)

Universidad de Cádiz: Cadiz, Andalucía, España

01/04/2017 hasta 21/03/2022

Profesor Ayudante Doctor (Departamento de Matematicas)

Universidad de Cádiz: Cadiz, Andalucía, España

01/10/2011 hasta 31/03/2017

Ph. D. Grant Holder (Computer Engineering and Mathematics)

Universitat Rovira i Virgili: Tarragona, Catalunya, España

01/10/2007 hasta 31/08/2011

Mathematics Instructor (Mathematics)

Instituto Superior Minero Metalúrgico de Moa: Moa, Holguin, CU

01/09/2003 hasta 31/03/2007

Obras

Lower (total) mutual-visibility number in graphs

2024 | JOURNAL_ARTICLE

Política de Cookies

Personalización de Cookies

Información ORCID de GONZALEZ YERO, ISMAEL

Biografía

Educación

Ph. D. (DEIM)

Grade in Mathematics (Mathematics)

Empleo

Profesor Titular de Universidad (Mathematics)

Profesor Contratado Doctor (Mathematics)

Profesor Ayudante Doctor (Departamento de Matematicas)

Ph. D. Grant Holder (Computer Engineering and Mathematics)

Mathematics Instructor (Mathematics)

Obras

Lower (total) mutual-visibility number in graphs

Lower general position sets in graphs

On mixed metric dimension in subdivision, middle, and total graphs

TRAVERSING A GRAPH IN GENERAL POSITION

A note on the metric and edge metric dimensions of 2-connected graphs

On vertices contained in all or in no metric basis

Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs

On the Packing Partitioning Problem on Directed Graphs

Covering Italian domination in graphs

Maker–Breaker Resolving Game

Approach to the Formulation of the Variable Change Theorem

On three outer-independent domination related parameters in graphs

On the total and strong version for Roman dominating functions in graphs

Total Roman {2}-domination in graphs

Constructive characterizations concerning weak Roman domination in trees

Dominating the Direct Product of Two Graphs through Total Roman Strategies

Global defensive k-alliances in directed graphs: combinatorial and computational issues

The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families

Edge Metric Dimension of Some Graph Operations

Further new results on strong resolving partitions for graphs

K-metric antidimension in graphs and anonymity in social networks

Distance-based vertex identification in graphs: The outer multiset dimension

Quasi-total Roman Domination in Graphs

Outer-independent total Roman domination in graphs

On the computational complexities of three problems related to a privacy measure for large networks under active attack

On analyzing and evaluating privacy measures for social networks under active attack

10th Andalusian Meeting on Discrete Mathematics

Efficient closed domination in digraph products

Packing and domination parameters in digraphs

The fractional k-metric dimension of graphs

The general position problem and strong resolving graphs

The fractional strong metric dimension in three graph products

Uniquely identifying the edges of a graph: The edge metric dimension

On Computational and Combinatorial Properties of the Total Co-independent Domination Number of Graphs

Strong resolving graphs: The realization and the characterization problems

Bounding the open k-monopoly number of strong product graphs

Error-correcting codes from k-resolving sets

On the strong Roman domination number of graphs

Computing the k -metric dimension of graphs

On the independence transversal total domination number of graphs

Resolvability and Strong Resolvability in the Direct Product of Graphs

Graphs that are simultaneously efficient open domination and efficient closed domination graphs

A survey on alliances in graphs: Defensive alliances

Computing the metric dimension of a graph from primary subgraphs

Mixed metric dimension of graphs

The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity

Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs

The security number of strong grid-like graphs

Vertices, edges, distances and metric dimension in graphs

Characterizing 1-Metric Antidimensional Trees and Unicyclic Graphs

The k-metric dimension of the lexicographic product of graphs

On some resolving partitions for the lexicographic product of two graphs

k -Metric antidimension: A privacy measure for social graphs

Closed formulae for the strong metric dimension of lexicographic product graphs

Convex dominating-geodetic partitions in graphs

Convex dominating-geodetic partitions in graphs

Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

Independent transversal dominating sets in graphs: Complexity and structural properties

Independent transversal dominating sets in graphs: Complexity and structural properties

On the monopolies of lexicographic product graphs: Bounds and closed formulas

Open k-monopolies in graphs: complexity and related concepts

The k-Metric Dimension of Corona Product Graphs

The partition dimension of corona product graphs

Total Roman domination in graphs

On the Strong Metric Dimension of Cartesian Sum Graphs