Learn More
Suppose we have a family F of sets. For every S ∈ F, a set D ⊆ S is a defining set for (F, S) if S is the only element of F that contains D as a subset. This concept has been studied in numerous cases, such as vertex colorings, perfect matchings, dominating sets, block designs, geodetics, orientations, and Latin squares. In this paper, first, we propose the(More)
  • 1