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 .
16 December 2025 in Bulletin of the Malaysian Mathematical Sciences Society
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.