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.
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)) .