Journal of Algebra and its Applications, cilt.24, sa.3, 2025 (SCI-Expanded)
Let Γ = (V, E) be a finite undirected graph without loops or multiple edges. A nonempty set of vertices _S ⊆ V is called powerful alliance if for every vertex u ∈ N[S], |N[u] ∩ S| ≥ |N[u] ∩ S|. A powerful alliance dominating set is called global. The global powerful alliance number γap(Γ) is defined as the minimum cardinality among all global powerful alliances. In this paper, we initiate the study of the global powerful alliance number of zero-divisor graphs Γ(R) with R is a finite commutative ring. Hence, we calculate γap(Γ(R)) for some usual kind of finite rings. As application, we give the global powerful alliance number of all zero-divisor graphs of finite commutative rings of order ≤ 7.