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 .
Transitivity on graphs is a concept widely investigated. This suggest to analyze the action of automorphisms on other sets. In this paper, we study the action on the family of -sets (minimum dominating sets), the graph is called -transitive if given two -sets there exists an automorphism which maps one onto the other. We deal with two families: paths and cycles . Their -sets are fully characterized and the action of the automorphism group on the family of -sets is fully analyzed.
26 December 2019 in Contributions to Discrete Mathematics
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.