Jair Castro Simon

Jair Castro Simon

Auto-generated profile, based on publicly available information

Jair Castro Simon

Unidad Académica de Matemáticas, Universidad Autónoma de Zacatecas "Francisco García Salinas", Paseo La Bufa, Int. Calzada Solidaridad

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
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)) .

20 May 2026 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
JSJair Castro Simon
Jair Castro Simon
JLJesús Leaños
Jesús Leaños
OCOmar Rosario Cayetano
Omar Rosario Cayetano
José M. SigarretaJosé M. Sigarreta
José M. Sigarreta
The central operator 𝒞( G ) is a structural transformation that combines edge subdivision with the complementation on the original vertex set. In this paper, we characterize the behavior of the differential ∂(𝒞( G )), an invariant that measures the maximum influence potential of a network. We establish sharp bounds for ∂(𝒞( G )) in terms of the order n and the maximum degree Δ( G ) of the base graph, proving a guaranteed growth property: for any connected graph of order n ≥ 4, ∂(𝒞( G )) ≥ ∂( G ̄)+1. Our structural analysis reveals a parsimony property of optimal sets. Specifically, Theorem 3.16 shows that minimum differential sets in 𝒞( G ) are primarily supported on the original vertex set V , effectively reducing the search space for optimization algorithms. Furthermore, in Theorem 3.22 we establish a notable theoretical convergence by identifying conditions under which the central, subdivision, and ℛ( G ) operators yield the same differential value, namely m + n − 4. Finally, we provide exact evaluations for several fundamental graph families and derive Nordhaus-Gaddum type inequalities (Prop. 3.24 and Cor. 3.25) for the class of trees. These results clarify how the central operator enhances the diffusion capacity of networks, thereby bridging the gap between topological transformations and practical influence maximization.