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.
Often for understanding a structure, other closely related structures with the former are associated. An example of this is the study of hyperspaces. In this paper, we give necessary and sufficient conditions for the existence of finitely-dimensional maximal free cells in the hyperspace of a dendrite G; then, we give necessary and sufficient conditions so that the aforementioned result can be applied when G is a dendroid. Furthermore, we prove that the arc is the unique arcwise connected, compact, and metric space X for which the anchored hyperspace is an arc for some .