Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Embed Hypothes.is?
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
  • Include attachments
Searching in
About 1 results
  • https://math.libretexts.org/Courses/SUNY_Schenectady_County_Community_College/Discrete_Structures/10%3A_Graph_Theory/10.08%3A_Trees
    More in general, we say that a vertex v is a descendent of a vertex u provided u is a vertex on the path from v to the root. Keep going until all vertices have been assigned one of the...More in general, we say that a vertex v is a descendent of a vertex u provided u is a vertex on the path from v to the root. Keep going until all vertices have been assigned one of the sets, alternating between A and B every “generation.” That is, a vertex is in set B if and only if it is the child of a vertex in set A.

Support Center

How can we help?