2 Matching Annotations
  1. Feb 2024
  2. math.libretexts.org math.libretexts.org
    7.2: Properties of Relations
    1
    1. ardzma 07 Feb 2024
      it is possible for a relation to be neither reflexive nor irreflexive.

      How a relation can be neither reflexire nor irreflexive?

      math discrete
    Visit annotations in context

    Tags

    Annotators

    URL

    math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/A_Spiral_Workbook_for_Discrete_Mathematics_(Kwong)/07:_Relations/7.02:_Properties_of_Relations
  3. Sep 2016
  4. en.wikipedia.org en.wikipedia.org
    Graph (discrete mathematics) - Wikipedia, the free encyclopedia
    1
    1. reachtarunhere 03 Sep 2016

      A forest is just a collection of trees. The main difference is that a forest does not necessarily need to be connected.

      math discrete math graph theory
    Visit annotations in context

    Tags

    Annotators

    URL

    en.wikipedia.org/wiki/Graph_(discrete_mathematics)