GHGerardo Reyna Hernández
Gerardo Reyna Hernández
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gerardo Reyna Hernández has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Jesús Romero Valencia
Facultad de Matemáticas, Universidad Autónoma de Guerrero, Chilpancingo 39087, Mexico
2 shared publications - Abel Cabrera Martínez
Universidad de Córdoba, Departamento de Matemáticas, Campus de Rabanales, 14071, Córdoba, Spain
1 shared publication - Ismael Rios-Villamar
Universidad Autónoma de Guerrero, Facultad de Matemáticas
1 shared publication - Ivan Espinobarros
Autonomous University of Guerrero
1 shared publication - Jose María Sigarreta
Facultad de Matematicas, Universidad Autonoma de Guerrero
1 shared publication - Omar Rosario Cayetano
Facultad de Matemáticas, Universidad Autonoma de Guerrero, Carlos E. Adame No. 54, Col. La Garita
1 shared publication
Latest Publications
- 16 December 2025
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (1) , 18
Double Total Domination Number of Some Graph Operators
- 16 December 2025
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (1) , 18
Double Total Domination Number of Some Graph Operators
- Open Access
- 19 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (3) , 298
On Global Offensive Alliance in Zero-Divisor Graphs
Let be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset is a global offensive alliance if every vertex satisfies that . The global offensive alliance number is defined as the minimum cardinality among all global offensive alliances. Let R be a finite commutative ring with identity. In this paper, we study the global offensive alliance number of the zero-divisor graph .- 19 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (3) , 298
Open AccessOn Global Offensive Alliance in Zero-Divisor Graphs
Let be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset is a global offensive alliance if every vertex satisfies that . The global offensive alliance number is defined as the minimum cardinality among all global offensive alliances. Let R be a finite commutative ring with identity. In this paper, we study the global offensive alliance number of the zero-divisor graph . - Open Access
- 26 December 2019
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 14 (1)
Anchored Hyperspaces and Multigraphs
Consider a multigraph $X$ as a metric space and $p \in X$. The anchored hyperspace at $p$ is the set $C_p(X) =$ {$A \subseteq X : p \in A, A$ connected and compact}. In this paper we will prove that $C_p(X)$ is a polytope if in this set is considered the Hausdorff's metric $H$. Further we will show that, if $X$ is a locally connected compact metric space such that $C_p(X)$ is a polytope for each $p \in X$, then $X$ must be a multigraph.- 26 December 2019
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 14 (1)
Open AccessAnchored Hyperspaces and Multigraphs
Consider a multigraph $X$ as a metric space and $p \in X$. The anchored hyperspace at $p$ is the set $C_p(X) =$ {$A \subseteq X : p \in A, A$ connected and compact}. In this paper we will prove that $C_p(X)$ is a polytope if in this set is considered the Hausdorff's metric $H$. Further we will show that, if $X$ is a locally connected compact metric space such that $C_p(X)$ is a polytope for each $p \in X$, then $X$ must be a multigraph.