Gerardo Reyna Hernández

Gerardo Reyna Hernández

Auto-generated profile, based on publicly available information

Gerardo Reyna Hernández

Facultad de Matematicas, Universidad Autonoma de Guerrero

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 July 2024 in International Electronic Journal of Mathematics Education
Verified
Journal Article
Open access
PDF file
IJIrma Joachin-Arizmendi
Irma Joachin-Arizmendi
ELEdgardo Locia-Espinoza
Edgardo Locia-Espinoza
AMArmando Morales-Carballo
Armando Morales-Carballo
GRGerardo Reyna-Hernández
Gerardo Reyna-Hernández
This paper presents the results of a study aimed at diagnosing how newly enrolled mathematics majors reason from a mathematical standpoint when they are required to perform inductive and deductive processes and validate or refute claims of a general nature. The theoretical framework underpinning this research comprises studies and investigations related to mathematical reasoning. The results of this diagnostic reveal that students lack mathematical reasoning skills that would allow them to justify statements of a general nature. In addition, they face difficulties in the development of deductive reasoning, are prone to generalize based on specific cases and lack skills in mathematical argumentation. On the other hand, they lack basic algebra skills such as developing square binomials and factoring. These findings highlight the need to design and implement a didactic proposal that fosters the development of reasoning and argumentation in students.

27 March 2026 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
RMRaúl Juárez Morales
Raúl Juárez Morales
GHGerardo Reyna Hernández
Gerardo Reyna Hernández
OCOmar Rosario Cayetano
Omar Rosario Cayetano
JSJair Castro Simón
Jair Castro Simón
If G = (V(G), E(G)) is a simple connected graph with vertex set V(G) and edge set E(G) , we say that a subset D ⊆ V(G) is a strong defensive alliance if for every vertex v ∈ D the condition δ D ( v ) ≥ δ D ̅ ( v ) holds. The strong defensive alliance number α(G) is defined as the minimum cardinality among all the strong defensive alliances. A unitary operator of graphs 𝒪 assigns to each graph G a graph 𝒪( G ). A few examples of unitary operators of graphs are: Subdivision S(G), R(G) , Middle Q(G) , Total T(G) , and Central 𝒞(G). In this paper we determine the exact values of α (S(G)) and α (R(G)) . We also characterize the graphs G for which the number of strong defensive alliances is 1, 2, or 3 in Q(G) and T(G) . We also we give tight bounds for α (S̅(G̅)) , α (Q(G)) , α (Q̅(G̅)) , α(T(G)) , and α(????(G)) .